Printed from https://ideas.repec.org/s/spr/coopap.html
Content
April 2024, Volume 87, Issue 3
- 707-710 Preface to special issue on “optimal control of nonlinear differential equations”
by Christian Clason - 711-751 Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension
by Elisabeth Diehl & Johannes Haubner & Michael Ulbrich & Stefan Ulbrich - 753-754 Correction to: Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier–Stokes equations with surface tension
by Elisabeth Diehl & Johannes Haubner & Michael Ulbrich & Stefan Ulbrich - 755-784 A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE
by Fabian Hoppe & Ira Neitzel - 785-809 Policy iteration for Hamilton–Jacobi–Bellman equations with control constraints
by Sudeep Kundu & Karl Kunisch - 811-833 Optimal control problems with $$L^0(\Omega )$$ L 0 ( Ω ) constraints: maximum principle and proximal gradient method
by Daniel Wachsmuth - 835-891 Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
by Benjamin Beach & Robert Burlacu & Andreas Bärmann & Lukas Hager & Robert Hildebrand - 893-934 Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II
by Benjamin Beach & Robert Burlacu & Andreas Bärmann & Lukas Hager & Robert Hildebrand - 935-976 The continuous stochastic gradient method: part I–convergence theory
by Max Grieshammer & Lukas Pflug & Michael Stingl & Andrian Uihlein - 977-1008 The continuous stochastic gradient method: part II–application and numerics
by Max Grieshammer & Lukas Pflug & Michael Stingl & Andrian Uihlein - 1009-1010 Correction to: The continuous stochastic gradient method: part II–application and numerics
by Max Grieshammer & Lukas Pflug & Michael Stingl & Andrian Uihlein - 1011-1031 A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares
by Shiru Li & Tao Zhang & Yong Xia - 1033-1057 Internet traffic tensor completion with tensor nuclear norm
by Can Li & Yannan Chen & Dong-Hui Li - 1059-1098 A Bregman–Kaczmarz method for nonlinear systems of equations
by Robert Gower & Dirk A. Lorenz & Maximilian Winkler
March 2024, Volume 87, Issue 2
- 337-354 Multiobjective BFGS method for optimization on Riemannian manifolds
by Shahabeddin Najafi & Masoud Hajarian - 355-395 Distribution-free algorithms for predictive stochastic programming in the presence of streaming data
by Shuotao Diao & Suvrajeet Sen - 397-437 Stochastic projective splitting
by Patrick R. Johnstone & Jonathan Eckstein & Thomas Flynn & Shinjae Yoo - 439-439 Correction to: Stochastic projective splitting
by Patrick R. Johnstone & Jonathan Eckstein & Thomas Flynn & Shinjae Yoo - 441-473 Efficiency of higher-order algorithms for minimizing composite functions
by Yassine Nabou & Ion Necoara - 475-499 A new technique to derive tight convex underestimators (sometimes envelopes)
by M. Locatelli - 501-530 A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems
by Felipe Fidalgo & Emerson Castelani & Guilherme Philippi - 531-569 A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique
by Mikhail A. Karapetyants - 571-610 Linearly convergent bilevel optimization with single-step inner methods
by Ensio Suonperä & Tuomo Valkonen - 611-640 Inexact proximal DC Newton-type method for nonconvex composite functions
by Shummin Nakayama & Yasushi Narushima & Hiroshi Yabe - 641-676 Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
by Stuart Harwood & Francisco Trespalacios & Dimitri Papageorgiou & Kevin Furman - 677-704 A nested genetic algorithm strategy for an optimal seismic design of frames
by A. Greco & F. Cannizzaro & R. Bruno & A. Pluchino - 705-706 Correction: On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions
by Claire Boyer & Antoine Godichon‑Baggioni
January 2024, Volume 87, Issue 1
- 1-37 Inexact proximal Newton methods in Hilbert spaces
by Bastian Pötzl & Anton Schiela & Patrick Jaap - 39-81 Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
by Shiwei Wang & Chao Ding - 83-116 A successive centralized circumcentered-reflection method for the convex feasibility problem
by Roger Behling & Yunier Bello-Cruz & Alfredo Iusem & Di Liu & Luiz-Rafael Santos - 117-147 Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization
by Zichong Li & Pin-Yu Chen & Sijia Liu & Songtao Lu & Yangyang Xu - 149-179 A trust-region approach for computing Pareto fronts in multiobjective optimization
by A. Mohammadi & A. L. Custódio - 181-218 From Halpern’s fixed-point iterations to Nesterov’s accelerated interpretations for root-finding problems
by Quoc Tran-Dinh - 219-247 Generalizations of the proximal method of multipliers in convex optimization
by R. Tyrrell Rockafellar - 249-288 Distributed stochastic compositional optimization problems over directed networks
by Shengchao Zhao & Yongchao Liu - 289-322 A modified inexact Levenberg–Marquardt method with the descent property for solving nonlinear equations
by Jianghua Yin & Jinbao Jian & Guodong Ma - 323-335 An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
by Javier F. Peña
December 2023, Volume 86, Issue 3
- 795-800 Preface to Asen L. Dontchev Memorial Special Issue
by William W. Hager & R. Tyrrell Rockafellar & Vladimir M. Veliov - 801-843 First order inertial optimization algorithms with threshold effects associated with dry friction
by Samir Adly & Hedy Attouch & Manh Hung Le - 845-870 Distributed forward-backward methods for ring networks
by Francisco J. Aragón-Artacho & Yura Malitsky & Matthew K. Tam & David Torregrosa-Belén - 871-884 Linear singularly perturbed systems without slow-fast split
by Zvi Artstein - 885-923 A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions
by Robert Baier & Elza Farkhi - 925-966 An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
by Radu Ioan Boţ & Ernö Robert Csetnek & Michael Sedlmayer - 967-988 Robust and continuous metric subregularity for linear inequality systems
by J. Camacho & M. J. Cánovas & M. A. López & J. Parra - 989-1034 A study of progressive hedging for stochastic integer programming
by Jeffrey Christiansen & Brian Dandurand & Andrew Eberhard & Fabricio Oliveira - 1035-1079 On the solution stability of parabolic optimal control problems
by Alberto Domínguez Corella & Nicolai Jork & Vladimir M. Veliov - 1081-1116 Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC
by Gabriele Eichfelder & Lars Grüne & Lisa Krügel & Jonas Schießl - 1117-1158 Radius theorems for subregularity in infinite dimensions
by Helmut Gfrerer & Alexander Y. Kruger - 1159-1191 On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction
by Helmut Gfrerer & Michael Mandlmayr & Jiří V. Outrata & Jan Valdman - 1193-1227 Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications
by Shaoyan Guo & Hou-Duo Qi & Liwei Zhang - 1229-1246 Extension of switch point algorithm to boundary-value problems
by William W. Hager - 1247-1274 Optimization over the Pareto front of nonconvex multi-objective optimal control problems
by C. Yalçın Kaya & Helmut Maurer - 1275-1298 Optimality conditions for Tucker low-rank tensor optimization
by Ziyan Luo & Liqun Qi - 1299-1325 Error estimates for Runge–Kutta schemes of optimal control problems with index 1 DAEs
by Björn Martens - 1327-1346 Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm
by R. Tyrrell Rockafellar - 1347-1372 The deepest event cuts in risk-averse optimization with application to radiation therapy design
by Constantine A. Vitt & Darinka Dentcheva & Andrzej Ruszczyński & Nolan Sandberg
November 2023, Volume 86, Issue 2
- 421-455 An accelerated proximal gradient method for multiobjective optimization
by Hiroki Tanabe & Ellen H. Fukuda & Nobuo Yamashita - 457-489 Spectral conjugate gradient methods for vector optimization problems
by Qing-Rui He & Chun-Rong Chen & Sheng-Jie Li - 491-519 A branch-and-prune algorithm for discrete Nash equilibrium problems
by Stefan Schwarze & Oliver Stein - 521-553 Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
by Tianxiang Liu & Ting Kei Pong & Akiko Takeda - 555-598 Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
by Shun Arahata & Takayuki Okuno & Akiko Takeda - 599-626 SCORE: approximating curvature information under self-concordant regularization
by Adeyemi D. Adeoye & Alberto Bemporad - 627-667 Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
by Dongdong Zhang & Shaohua Pan & Shujun Bi & Defeng Sun - 669-710 A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems
by Gui-Hua Lin & Zhen-Ping Yang & Hai-An Yin & Jin Zhang - 711-743 A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity
by Letícia Becher & Damián Fernández & Alberto Ramos - 745-766 Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines
by Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico - 767-794 A space–time variational method for optimal control problems: well-posedness, stability and numerical solution
by Nina Beranek & Martin Alexander Reinhold & Karsten Urban
September 2023, Volume 86, Issue 1
- 1-48 A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
by David Ek & Anders Forsgren - 49-78 Recycling basic columns of the splitting preconditioner in interior point methods
by Cecilia Orellana Castro & Manolo Rodriguez Heredia & Aurelio R. L. Oliveira - 79-116 Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction
by Albert S. Berahas & Jiahao Shi & Zihong Yi & Baoyu Zhou - 117-161 On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
by Kuang-Yu Ding & Xin-Yee Lam & Kim-Chuan Toh - 163-197 On solving difference of convex functions programs with linear complementarity constraints
by Hoai An Thi & Thi Minh Tam Nguyen & Tao Pham Dinh - 199-240 Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
by Hezhi Luo & Xianye Zhang & Huixian Wu & Weiqiang Xu - 241-273 An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
by Shaoze Li & Zhibin Deng & Cheng Lu & Junhao Wu & Jinyu Dai & Qiao Wang - 275-302 Average curvature FISTA for nonconvex smooth composite optimization problems
by Jiaming Liang & Renato D. C. Monteiro - 303-344 Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
by Cheik Traoré & Saverio Salzo & Silvia Villa - 345-381 A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems
by Baohua Huang & Wen Li - 383-420 GLISp-r: a preference-based optimization algorithm with convergence guarantees
by Davide Previtali & Mirko Mazzoleni & Antonio Ferramosca & Fabio Previdi
July 2023, Volume 85, Issue 3
- 681-682 Preface to the 5th Brazil–China Symposium on Applied and Computational Mathematics
by Jinyun Yuan - 683-703 Quadratic regularization methods with finite-difference gradient approximations
by Geovani Nunes Grapiglia - 705-752 Distributionally robust Weber problem with uncertain demand
by Yan Gu & Jianlin Jiang & Shun Zhang - 753-786 Greedy PSB methods with explicit superlinear convergence
by Zhen-Yuan Ji & Yu-Hong Dai - 787-820 Increasing reliability of price signals in long term energy management problems
by Guillaume Erbs & Clara Lage & Claudia Sagastizábal & Mikhail Solodov - 821-856 Convergence of derivative-free nonmonotone Direct Search Methods for unconstrained and box-constrained mixed-integer optimization
by Ubaldo M. García Palomares - 857-896 Conditional gradient method for vector optimization
by Wang Chen & Xinmin Yang & Yong Zhao - 897-935 Riemannian optimization on unit sphere with p-norm and its applications
by Hiroyuki Sato - 937-971 Inexact penalty decomposition methods for optimization problems with geometric constraints
by Christian Kanzow & Matteo Lapucci - 973-992 Convergence rate estimates for penalty methods revisited
by A. F. Izmailov & M. V. Solodov - 993-1031 DC semidefinite programming and cone constrained DC optimization II: local search methods
by M. V. Dolgopolik - 1033-1072 A communication-efficient and privacy-aware distributed algorithm for sparse PCA
by Lei Wang & Xin Liu & Yin Zhang
June 2023, Volume 85, Issue 2
- 337-367 Branch-and-Model: a derivative-free global optimization algorithm
by Kaiwen Ma & Luis Miguel Rios & Atharv Bhosekar & Nikolaos V. Sahinidis & Sreekanth Rajagopalan - 369-407 Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
by Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson - 409-439 Globally optimal univariate spline approximations
by Robert Mohr & Maximilian Coblenz & Peter Kirst - 441-478 A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints
by Drew P. Kouri & Mathias Staudigl & Thomas M. Surowiec - 479-508 Optimal control of the stationary Kirchhoff equation
by Masoumeh Hashemi & Roland Herzog & Thomas M. Surowiec - 509-545 An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
by Weiwei Kong & Renato D. C. Monteiro - 547-582 A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
by Yong-Jin Liu & Jing Yu - 583-619 Doubly iteratively reweighted algorithm for constrained compressed sensing models
by Shuqin Sun & Ting Kei Pong - 621-652 Partially symmetric tensor structure preserving rank-R approximation via BFGS algorithm
by Ciwen Chen & Guyan Ni & Bo Yang - 653-679 A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems
by Erfan Yazdandoost Hamedani & Afrooz Jalilzadeh
May 2023, Volume 85, Issue 1
- 1-32 An inexact Riemannian proximal gradient method
by Wen Huang & Ke Wei - 33-73 A limited memory Quasi-Newton approach for multi-objective optimization
by Matteo Lapucci & Pierluigi Mansueto - 75-106 A harmonic framework for stepsize selection in gradient methods
by Giulia Ferrandi & Michiel E. Hochstenbach & Nataša Krejić - 107-146 An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
by Hong T. M. Chu & Ling Liang & Kim-Chuan Toh & Lei Yang - 147-179 A split Levenberg-Marquardt method for large-scale sparse problems
by Nataša Krejić & Greta Malaspina & Lense Swaenen - 181-211 Integer set reduction for stochastic mixed-integer programming
by Saravanan Venkatachalam & Lewis Ntaimo - 213-246 Simple approximative algorithms for free-support Wasserstein barycenters
by Johannes von Lindheim - 247-261 A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint
by Zhijun Xu & Jing Zhou - 263-291 An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function
by Ying Gao & Wenxing Zhang - 293-335 A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles
by Johannes Schmidt & Armin Fügenschuh
April 2023, Volume 84, Issue 3
- 651-702 Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition
by Brian Irwin & Eldad Haber - 703-735 Conic formulation of QPCCs applied to truly sparse QPs
by Immanuel M. Bomze & Bo Peng - 737-760 A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ ℓ 0 regularization problem
by Jie Zhang & Xinmin Yang & Gaoxi Li & Ke Zhang - 761-788 T-product factorization based method for matrix and tensor completion problems
by Quan Yu & Xinzhen Zhang - 789-831 Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
by Renaud Chicoisne - 833-874 Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares
by Naoki Marumo & Takayuki Okuno & Akiko Takeda - 875-919 A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
by Yitian Qian & Shaohua Pan & Shujun Bi - 921-972 On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions
by Claire Boyer & Antoine Godichon-Baggioni - 973-1003 Lifted stationary points of sparse optimization with complementarity constraints
by Shisen Liu & Xiaojun Chen - 1005-1033 A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
by Yonggang Pei & Shaofang Song & Detong Zhu
March 2023, Volume 84, Issue 2
- 295-318 On FISTA with a relative error rule
by Yunier Bello-Cruz & Max L. N. Gonçalves & Nathan Krislock - 319-362 An abstract convergence framework with application to inertial inexact forward–backward methods
by Silvia Bonettini & Peter Ochs & Marco Prato & Simone Rebegoldi - 363-395 Inexact gradient projection method with relative error tolerance
by A. A. Aguiar & O. P. Ferreira & L. F. Prudente - 397-420 A subgradient method with non-monotone line search
by O. P. Ferreira & G. N. Grapiglia & E. M. Santos & J. C. O. Souza - 421-447 Loss functions for finite sets
by Jiawang Nie & Suhan Zhong - 449-476 Efficient differentiable quadratic programming layers: an ADMM approach
by Andrew Butler & Roy H. Kwon - 477-508 A global exact penalty for rank-constrained optimization problem and applications
by Zhikai Yang & Le Han - 509-529 On global convergence of alternating least squares for tensor approximation
by Yuning Yang - 531-572 Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization
by Juan Gao & Xin-Wei Liu & Yu-Hong Dai & Yakui Huang & Junhua Gu - 573-607 OFFO minimization algorithms for second-order optimality and their complexity
by S. Gratton & Ph. L. Toint - 609-649 A two-level distributed algorithm for nonconvex constrained optimization
by Kaizhao Sun & X. Andy Sun
January 2023, Volume 84, Issue 1
- 1-4 Special issue for SIMAI 2020–2021: large-scale optimization and applications
by Valeria Ruggiero & Gerardo Toraldo - 5-26 Cartoon-texture evolution for two-region image segmentation
by Laura Antonelli & Valentina De Simone & Marco Viola - 27-52 A random time-dependent noncooperative equilibrium problem
by Annamaria Barbagallo & Serena Guarino Lo Bianco - 53-84 A stochastic first-order trust-region method with inexact restoration for finite-sum minimization
by Stefania Bellavia & Nataša Krejić & Benedetta Morini & Simone Rebegoldi - 85-123 A nested primal–dual FISTA-like scheme for composite convex optimization problems
by S. Bonettini & M. Prato & S. Rebegoldi - 125-149 Constrained and unconstrained deep image prior optimization models with automatic regularization
by Pasquale Cascarano & Giorgia Franchini & Erich Kobler & Federica Porta & Andrea Sebastiani - 151-189 Hybrid limited memory gradient projection methods for box-constrained optimization problems
by Serena Crisci & Federica Porta & Valeria Ruggiero & Luca Zanni - 191-223 An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations
by Dominik Garmatter & Margherita Porcelli & Francesco Rinaldi & Martin Stoll - 225-264 Avoiding bad steps in Frank-Wolfe variants
by Francesco Rinaldi & Damiano Zeffiro - 265-294 From inexact optimization to learning via gradient concentration
by Bernhard Stankewitz & Nicole Mücke & Lorenzo Rosasco
December 2022, Volume 83, Issue 3
- 723-726 COAP 2021 Best Paper Prize
by Christian Kanzow & Theresa Lechner - 727-757 General-purpose preconditioning for regularized interior point methods
by Jacek Gondzio & Spyridon Pougkakiotis & John W. Pearson - 759-800 Modeling design and control problems involving neural network surrogates
by Dominic Yang & Prasanna Balaprakash & Sven Leyffer - 801-844 Solving constrained nonsmooth group sparse optimization via group Capped- $$\ell _1$$ ℓ 1 relaxation and group smoothing proximal gradient algorithm
by Xian Zhang & Dingtao Peng - 845-892 “FISTA” in Banach spaces with adaptive discretisations
by Antonin Chambolle & Robert Tovey - 893-931 New Bregman proximal type algorithms for solving DC optimization problems
by Shota Takahashi & Mituhiro Fukuda & Mirai Tanaka - 933-966 Completely positive factorization by a Riemannian smoothing method
by Zhijian Lai & Akiko Yoshise - 967-997 An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis
by Hao Wang & Hao Zeng & Jiashan Wang - 999-1026 Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions
by Scott B. Lindstrom - 1027-1064 A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
by Yuya Yamakawa & Takayuki Okuno
November 2022, Volume 83, Issue 2
- 381-401 Levenberg–Marquardt method based on probabilistic Jacobian models for nonlinear equations
by Ruixue Zhao & Jinyan Fan - 403-434 Globally convergent Newton-type methods for multiobjective optimization
by M. L. N. Gonçalves & F. S. Lima & L. F. Prudente - 435-464 Efficient scalarization in multiobjective optimal control of a nonsmooth PDE
by Marco Bernreuther & Georg Müller & Stefan Volkwein - 465-524 Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces
by Shisheng Cui & Uday Shanbhag & Mathias Staudigl & Phan Vuong - 525-553 Minimum cost b-matching problems with neighborhoods
by I. Espejo & R. Páez & J. Puerto & A. M. Rodríguez-Chía - 555-592 Shortest path with acceleration constraints: complexity and approximation algorithms
by S. Ardizzoni & L. Consolini & M. Laurini & M. Locatelli - 593-614 A generalized shortest path tour problem with time windows
by L. Di Puglia Pugliese & D. Ferone & P. Festa & F. Guerriero - 615-649 Generalized Nesterov’s accelerated proximal gradient algorithms with convergence rate of order o(1/k2)
by Huynh Ngai & Ta Anh Son - 651-691 Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
by Hongwei Liu & Ting Wang & Zexian Liu - 693-721 Minimization over the $$\ell _1$$ ℓ 1 -ball using an active-set non-monotone projected gradient
by Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi
September 2022, Volume 83, Issue 1
- 1-27 Block coordinate descent for smooth nonconvex constrained minimization
by E. G. Birgin & J. M. Martínez - 29-66 Quantifying uncertainty with ensembles of surrogates for blackbox optimization
by Charles Audet & Sébastien Le Digabel & Renaud Saltet - 67-109 Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem
by James Campbell & Ángel Corberán & Isaac Plana & José M. Sanchis & Paula Segura - 111-141 Robust min-max regret covering problems
by Amadeu A. Coco & Andréa Cynthia Santos & Thiago F. Noronha - 143-180 A stochastic primal-dual method for a class of nonconvex constrained optimization
by Lingzi Jin & Xiao Wang - 181-210 Sub-linear convergence of a stochastic proximal iteration method in Hilbert space
by Monika Eisenmann & Tony Stillfjord & Måns Williamson - 211-246 Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
by Fabio Vitor & Todd Easton - 247-285 Inertial alternating direction method of multipliers for non-convex non-smooth optimization
by Le Thi Khanh Hien & Duy Nhat Phan & Nicolas Gillis - 287-317 Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization
by Xin Qu & Wei Bian - 319-348 A product space reformulation with reduced dimension for splitting algorithms
by Rubén Campoy - 349-380 Abstract strongly convergent variants of the proximal point algorithm
by Andrei Sipoş
July 2022, Volume 82, Issue 3
- 561-593 Finite-sum smooth optimization with SARAH
by Lam M. Nguyen & Marten Dijk & Dzung T. Phan & Phuong Ha Nguyen & Tsui-Wei Weng & Jayant R. Kalagnanam - 595-615 Randomized Kaczmarz methods for tensor complementarity problems
by Xuezhong Wang & Maolin Che & Yimin Wei - 617-647 Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS
by Pedro Borges - 649-671 DC Semidefinite programming and cone constrained DC optimization I: theory
by M. V. Dolgopolik - 673-715 Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
by Weiwei Kong & Renato D. C. Monteiro - 717-751 Design of a heuristic algorithm for the generalized multi-objective set covering problem
by Lakmali Weerasena & Aniekan Ebiefung & Anthony Skjellum - 753-794 A path-following inexact Newton method for PDE-constrained optimal control in BV
by D. Hafemeyer & F. Mannel
June 2022, Volume 82, Issue 2
- 293-327 Derivative-free methods for mixed-integer nonsmooth constrained optimization
by Tommaso Giovannelli & Giampaolo Liuzzi & Stefano Lucidi & Francesco Rinaldi - 329-360 On initial point selection of the steepest descent algorithm for general quadratic functions
by Masoud Fatemi - 361-394 Accelerated gradient sliding for structured convex optimization
by Guanghui Lan & Yuyuan Ouyang - 395-440 Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
by Andreas Themelis & Lorenzo Stella & Panagiotis Patrinos - 441-463 Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
by Xianfu Wang & Ziyuan Wang - 465-498 Second order semi-smooth Proximal Newton methods in Hilbert spaces
by Bastian Pötzl & Anton Schiela & Patrick Jaap - 499-524 A level set method for Laplacian eigenvalue optimization subject to geometric constraints
by Meizhi Qian & Shengfeng Zhu - 525-559 QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization
by Arnaud Flori & Hamouche Oulhadj & Patrick Siarry
May 2022, Volume 82, Issue 1
- 1-29 Leveraging special-purpose hardware for local search heuristics
by Xiaoyuan Liu & Hayato Ushijima-Mwesigwa & Avradip Mandal & Sarvagya Upadhyay & Ilya Safro & Arnab Roy - 31-60 An adaptive trust-region method without function evaluations
by Geovani N. Grapiglia & Gabriel F. D. Stella - 61-88 A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
by Hardik Tankaria & Shinji Sugimoto & Nobuo Yamashita - 89-106 Local saddle points for unconstrained polynomial optimization
by Wenjie Zhao & Guangming Zhou - 107-138 Parametric shape optimization using the support function
by Pedro R. S. Antunes & Beniamin Bogosel - 139-139 Correction to: Parametric shape optimization using the support function
by Pedro R. S. Antunes & Beniamin Bogosel - 141-173 An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
by Tianxiang Liu & Akiko Takeda - 175-224 Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
by Qihang Lin & Runchao Ma & Yangyang Xu - 225-249 Robust output-feedback stabilization for incompressible flows using low-dimensional $$\mathcal {H}_{\infty }$$ H ∞ -controllers
by Peter Benner & Jan Heiland & Steffen W. R. Werner - 251-291 SDP-based bounds for graph partition via extended ADMM
by Angelika Wiegele & Shudian Zhao
April 2022, Volume 81, Issue 3
- 689-715 Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients
by E. G. Birgin & J. M. Martínez - 717-740 On the acceleration of the Barzilai–Borwein method
by Yakui Huang & Yu-Hong Dai & Xin-Wei Liu & Hongchao Zhang