Content
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 - 741-767 A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design
by Dominique Monnet & Warren Hare & Yves Lucet - 769-788 Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems
by V. A. Ramirez & G. N. Sottosanto - 789-828 Clustering-based multipopulation approaches in MOEA/D for many-objective problems
by Christian Lücken & Carlos A. Brizuela & Benjamín Barán - 829-856 Diagonal BFGS updates and applications to the limited memory BFGS method
by Donghui Li & Xiaozhou Wang & Jiajian Huang - 857-887 Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation
by Elisha R. Pager & Anil V. Rao - 889-921 A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties
by Mengya Feng & Tongjun Sun - 923-954 Finding the global optimum of a class of quartic minimization problem
by Pengfei Huang & Qingzhi Yang & Yuning Yang
March 2022, Volume 81, Issue 2
- 337-368 $$\rho$$ ρ -regularization subproblems: strong duality and an eigensolver-based algorithm
by Liaoyuan Zeng & Ting Kei Pong - 369-395 On a primal-dual Newton proximal method for convex quadratic programs
by Alberto Marchi - 397-421 Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method
by Yuya Yamakawa & Hiroyuki Sato - 423-478 Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
by Meenarli Sharma & Prashant Palkar & Ashutosh Mahajan - 479-518 An inexact accelerated stochastic ADMM for separable convex optimization
by Jianchao Bai & William W. Hager & Hongchao Zhang - 519-538 A smoothing proximal gradient algorithm for matrix rank minimization problem
by Quan Yu & Xinzhen Zhang - 539-567 A reduced proximal-point homotopy method for large-scale non-convex BQP
by Xiubo Liang & Guoqiang Wang & Bo Yu - 569-611 Iterative regularization for constrained minimization formulations of nonlinear inverse problems
by Barbara Kaltenbacher & Kha Huynh - 613-656 An alternate approach to solve two-level priority based assignment problem
by Fanrong Xie & Anuj Sharma & Zuoan Li - 657-687 A general variable neighborhood search for the cyclic antibandwidth problem
by Sergio Cavero & Eduardo G. Pardo & Abraham Duarte
January 2022, Volume 81, Issue 1
- 1-30 On large-scale unconstrained optimization and arbitrary regularization
by J. M. Martínez & L. T. Santos - 31-66 A sublevel moment-SOS hierarchy for polynomial optimization
by Tong Chen & Jean-Bernard Lasserre & Victor Magron & Edouard Pauwels - 67-90 A Riemannian rank-adaptive method for low-rank matrix completion
by Bin Gao & P.-A. Absil - 91-125 On the inexact scaled gradient projection method
by O. P. Ferreira & M. Lemes & L. F. Prudente - 127-159 Bregman primal–dual first-order method and application to sparse semidefinite programming
by Xin Jiang & Lieven Vandenberghe - 161-177 On R-linear convergence analysis for a class of gradient methods
by Na Huang - 179-200 Expected complexity analysis of stochastic direct-search
by Kwassi Joseph Dzahini - 201-250 Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse
by Murwan Siddig & Yongjia Song - 251-288 A piecewise conservative method for unconstrained convex optimization
by A. Scagliotti & P. Colli Franzone - 289-308 Finding best approximation pairs for two intersections of closed convex sets
by Heinz H. Bauschke & Shambhavi Singh & Xianfu Wang - 309-336 Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
by Michael Haythorpe & Walter Murray
December 2021, Volume 80, Issue 3
- 687-729 A data-driven approach for a class of stochastic dynamic optimization problems
by Thuener Silva & Davi Valladão & Tito Homem-de-Mello - 731-753 A zeroth order method for stochastic weakly convex optimization
by V. Kungurtsev & F. Rinaldi - 755-780 Two limited-memory optimization methods with minimum violation of the previous secant conditions
by Jan Vlček & Ladislav Lukšan - 781-830 A distributed algorithm for high-dimension convex quadratically constrained quadratic programs
by Run Chen & Andrew L. Liu - 831-851 A parallel splitting ALM-based algorithm for separable convex programming
by Shengjie Xu & Bingsheng He - 853-881 Optimal portfolio selections via $$\ell _{1, 2}$$ ℓ 1 , 2 -norm regularization
by Hongxin Zhao & Lingchen Kong & Hou-Duo Qi - 883-913 T-product factorization method for internet traffic data completion with spatio-temporal regularization
by Chen Ling & Gaohang Yu & Liqun Qi & Yanwei Xu - 915-941 $${\text {B}}$$ B -subdifferentials of the projection onto the matrix simplex
by Shenglong Hu & Guoyin Li - 943-978 Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers
by A. F. Izmailov - 979-1025 Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids
by Sergio González-Andrade & Sofía López-Ordóñez & Pedro Merino
November 2021, Volume 80, Issue 2
- 321-346 Forward-reflected-backward method with variance reduction
by Ahmet Alacaoglu & Yura Malitsky & Volkan Cevher - 347-375 MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM
by Timotej Hrga & Janez Povh - 377-409 Two new bidirectional search algorithms
by John A. Pavlik & Edward C. Sewell & Sheldon H. Jacobson - 411-438 An augmented subgradient method for minimizing nonsmooth DC functions
by A. M. Bagirov & N. Hoseini Monjezi & S. Taheri - 439-481 On solving a class of fractional semi-infinite polynomial programming problems
by Feng Guo & Liguo Jiao - 483-521 Exploiting term sparsity in noncommutative polynomial optimization
by Jie Wang & Victor Magron - 523-548 Two methods for the maximization of homogeneous polynomials over the simplex
by Faizan Ahmed & Georg Still - 549-585 Strengthened splitting methods for computing resolvents
by Francisco J. Aragón Artacho & Rubén Campoy & Matthew K. Tam - 587-615 Newton-type methods near critical solutions of piecewise smooth nonlinear equations
by A. Fischer & A. F. Izmailov & M. Jelitte - 617-638 The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems
by Zhizhi Li & Huai Zhang & Le Ou-Yang - 639-677 A proximal gradient method for control problems with non-smooth and non-convex control cost
by Carolin Natemeyer & Daniel Wachsmuth - 679-680 Correction to: Globalized inexact proximal Newton-type methods for nonconvex composite functions
by Christian Kanzow & Theresa Lechner
September 2021, Volume 80, Issue 1
- 1-32 An effective procedure for feature subset selection in logistic regression based on information criteria
by Enrico Civitelli & Matteo Lapucci & Fabio Schoen & Alessio Sortino - 33-53 A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
by Giulio Galvan & Marco Sciandrone & Stefano Lucidi - 55-88 Compact representations of structured BFGS matrices
by Johannes J. Brust & Zichao (Wendy) Di & Sven Leyffer & Cosmin G. Petra - 89-120 An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
by Xiaodong Ding & Hezhi Luo & Huixian Wu & Jianzhen Liu - 121-152 Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
by Ion Necoara & Angelia Nedić - 153-184 Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches
by Shen Peng & Jie Jiang - 185-211 Sequential optimality conditions for cardinality-constrained optimization problems with applications
by Christian Kanzow & Andreas B. Raharja & Alexandra Schwartz - 213-244 Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem
by Jingyong Tang & Jinchuan Zhou - 245-269 Alternating conditional gradient method for convex feasibility problems
by R. Díaz Millán & O. P. Ferreira & L. F. Prudente - 271-300 Sparse Dirichlet optimal control problems
by Mariano Mateos - 301-320 A third-order weighted essentially non-oscillatory scheme in optimal control problems governed by nonlinear hyperbolic conservation laws
by David Frenzel & Jens Lang
July 2021, Volume 79, Issue 3
- 531-559 Subspace quadratic regularization method for group sparse multinomial logistic regression
by Rui Wang & Naihua Xiu & Kim-Chuan Toh - 561-599 Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
by G. Liuzzi & M. Locatelli & V. Piccialli & S. Rass - 601-631 An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
by F. J. Hwang & Yao-Huei Huang - 633-648 On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming
by R. Andreani & E. H. Fukuda & G. Haeser & D. O. Santos & L. D. Secchin - 649-679 A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
by Jiaming Liang & Renato D. C. Monteiro & Chee-Khian Sim - 681-715 Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
by Masoud Ahookhosh & Le Thi Khanh Hien & Nicolas Gillis & Panagiotis Patrinos - 717-766 Fastest rates for stochastic mirror descent methods
by Filip Hanzely & Peter Richtárik - 767-787 A dual simplex-type algorithm for the smallest enclosing ball of balls
by Marta Cavaleiro & Farid Alizadeh - 789-816 Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
by David Ek & Anders Forsgren
June 2021, Volume 79, Issue 2
- 235-271 Matrix optimization based Euclidean embedding with outliers
by Qian Zhang & Xinyuan Zhao & Chao Ding - 273-300 Low-rank factorization for rank minimization with nonconvex regularizers
by April Sagan & John E. Mitchell - 301-338 DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
by Jean Bigeon & Sébastien Le Digabel & Ludovic Salomon - 339-368 A stochastic subspace approach to gradient-free optimization in high dimensions
by David Kozak & Stephen Becker & Alireza Doostan & Luis Tenorio - 369-404 Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences
by Majid Jahani & Naga Venkata C. Gudapati & Chenxin Ma & Rachael Tappenden & Martin Takáč - 405-440 Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
by Filip Hanzely & Peter Richtárik & Lin Xiao - 441-469 A Laplacian approach to $$\ell _1$$ ℓ 1 -norm minimization
by Vincenzo Bonifaci - 471-506 An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
by Rujun Jiang & Man-Chung Yue & Zhishuo Zhou - 507-530 The circumcentered-reflection method achieves better rates than alternating projections
by Reza Arefidamghani & Roger Behling & Yunier Bello-Cruz & Alfredo N. Iusem & Luiz-Rafael Santos
May 2021, Volume 79, Issue 1
- 1-34 Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
by Charles Audet & Kwassi Joseph Dzahini & Michael Kokkolaras & Sébastien Le Digabel - 35-65 Generating set search using simplex gradients for bound-constrained black-box optimization
by Sander Dedoncker & Wim Desmet & Frank Naets - 67-99 A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure
by Haodong Yu & Jie Sun & Yanjun Wang - 101-125 Quantitative results on a Halpern-type proximal point algorithm
by Laurenţiu Leuştean & Pedro Pinto - 127-154 Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
by Shummin Nakayama & Yasushi Narushima & Hiroshi Yabe - 155-191 Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
by David Ek & Anders Forsgren - 193-221 Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation
by Sven Leyffer & Paul Manns & Malte Winckler - 223-233 MINLP formulations for continuous piecewise linear function fitting
by Noam Goldberg & Steffen Rebennack & Youngdae Kim & Vitaliy Krasko & Sven Leyffer
April 2021, Volume 78, Issue 3
- 675-704 Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games
by Pedro Borges & Claudia Sagastizábal & Mikhail Solodov - 705-740 Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
by Caroline Geiersbach & Teresa Scarinci - 741-768 Conditional gradient method for multiobjective optimization
by P. B. Assunção & O. P. Ferreira & L. F. Prudente - 769-792 The Tikhonov regularization for vector equilibrium problems
by Lam Quoc Anh & Tran Quoc Duy & Le Dung Muu & Truong Van Tri - 793-824 Gauss–Newton-type methods for bilevel optimization
by Jörg Fliege & Andrey Tin & Alain Zemkoho - 825-851 A proximal DC approach for quadratic assignment problem
by Zhuoxuan Jiang & Xinyuan Zhao & Chao Ding - 853-891 A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
by Xinxin Li & Ting Kei Pong & Hao Sun & Henry Wolkowicz - 893-913 Polyhedral approximations of the semidefinite cone and their application
by Yuzhu Wang & Akihiro Tanaka & Akiko Yoshise - 915-952 On the properties of the cosine measure and the uniform angle subspace
by Rommel G. Regis - 953-982 Secant Update generalized version of PSB: a new approach
by Nicolas Boutet & Rob Haelterman & Joris Degroote
March 2021, Volume 78, Issue 2
- 307-351 An interior point-proximal method of multipliers for convex quadratic programming
by Spyridon Pougkakiotis & Jacek Gondzio - 353-375 Using partial spectral information for block diagonal preconditioning of saddle-point systems
by Alison Ramage & Daniel Ruiz & Annick Sartenaer & Charlotte Tannier - 377-410 Globalized inexact proximal Newton-type methods for nonconvex composite functions
by Christian Kanzow & Theresa Lechner - 411-450 Nonconvex robust programming via value-function optimization
by Ying Cui & Ziyu He & Jong-Shi Pang - 451-490 A bundle method for nonsmooth DC programming with application to chance-constrained problems
by W. Ackooij & S. Demassey & P. Javal & H. Morais & W. Oliveira & B. Swaminathan - 491-528 Finding multi-objective supported efficient spanning trees
by Pedro Correia & Luís Paquete & José Rui Figueira - 529-557 The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials
by Jiawang Nie & Xindong Tang & Lingling Xu - 559-573 Tensor Z-eigenvalue complementarity problems
by Meilan Zeng - 575-623 On mixed-integer optimal control with constrained total variation of the integer control
by Sebastian Sager & Clemens Zeile - 625-674 Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization
by Alain B. Zemkoho & Shenglong Zhou
January 2021, Volume 78, Issue 1
- 1-42 An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
by Chungen Shen & Yunlong Wang & Wenjuan Xue & Lei-Hong Zhang - 43-85 Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$ ℓ 0 -minimization problems
by Yue Xie & Uday V. Shanbhag - 87-124 Convergence study on strictly contractive Peaceman–Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
by Peixuan Li & Yuan Shen & Suhong Jiang & Zehua Liu & Caihua Chen - 125-166 Single-forward-step projective splitting: exploiting cocoercivity
by Patrick R. Johnstone & Jonathan Eckstein - 167-180 Properties of the delayed weighted gradient method
by Roberto Andreani & Marcos Raydan - 181-203 Implementing and modifying Broyden class updates for large scale optimization
by Martin Buhmann & Dirk Siegel - 205-238 Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems
by Yannan Chen & Hailin Sun & Huifu Xu - 239-272 T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
by Meng-Meng Zheng & Zheng-Hai Huang & Yong Wang - 273-286 Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations
by A. Fischer & A. F. Izmailov & M. V. Solodov - 287-306 An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
by Weiwei Pan & Jingjing Shen & Zi Xu
December 2020, Volume 77, Issue 3
- 627-651 Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton’s equation
by Andrea Caliciotti & Giovanni Fasano & Florian Potra & Massimo Roma - 653-710 Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
by Nicolas Loizou & Peter Richtárik - 711-728 A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
by Masao Fukushima & Joaquim Júdice & Welington Oliveira & Valentina Sessa - 729-754 Convergence rates for an inexact ADMM applied to separable convex optimization
by William W. Hager & Hongchao Zhang - 755-777 A proximal-point outer approximation algorithm
by Massimo De Mauri & Joris Gillis & Jan Swevers & Goele Pipeleers - 779-810 Riemannian conjugate gradient methods with inverse retraction
by Xiaojing Zhu & Hiroyuki Sato - 811-830 Hybrid Riemannian conjugate gradient methods with global convergence properties
by Hiroyuki Sakai & Hideaki Iiduka - 831-869 A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems
by Veronika Karl & Ira Neitzel & Daniel Wachsmuth - 871-896 Expected residual minimization method for monotone stochastic tensor complementarity problem
by Zhenyu Ming & Liping Zhang & Liqun Qi - 897-918 On the use of polynomial models in multiobjective directional direct search
by C. P. Brás & A. L. Custódio
November 2020, Volume 77, Issue 2
- 335-350 An explicit Tikhonov algorithm for nested variational inequalities
by Lorenzo Lampariello & Christoph Neumann & Jacopo M. Ricci & Simone Sagratella & Oliver Stein - 351-378 On the interplay between acceleration and identification for the proximal gradient algorithm
by Gilles Bareilles & Franck Iutzeler - 379-409 A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
by M. Maleknia & M. Shamsi - 411-432 Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization
by Yunmei Chen & Xiaojing Ye & Wei Zhang - 433-463 A variation of Broyden class methods using Householder adaptive transforms
by S. Cipolla & C. Di Fiore & P. Zellini - 465-490 The distance between convex sets with Minkowski sum structure: application to collision detection
by Xiangfeng Wang & Junping Zhang & Wenxing Zhang - 491-508 Weak convergence of iterative methods for solving quasimonotone variational inequalities
by Hongwei Liu & Jun Yang - 509-537 On a numerical shape optimization approach for a class of free boundary problems
by A. Boulkhemair & A. Chakib & A. Nachaoui & A. A. Niftiyev & A. Sadik - 539-569 Oracle-based algorithms for binary two-stage robust optimization
by Nicolas Kämmerling & Jannis Kurtz - 571-595 Global optimization via inverse distance weighting and radial basis functions
by Alberto Bemporad - 597-616 Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation
by Siamak Akbarzadeh & Jan Hückelheim & Jens-Dominik Müller
September 2020, Volume 77, Issue 1
- 1-27 On the convergence of steepest descent methods for multiobjective optimization
by G. Cocchi & G. Liuzzi & S. Lucidi & M. Sciandrone - 29-56 An augmented Lagrangian algorithm for multi-objective optimization
by G. Cocchi & M. Lapucci - 57-89 An active-set algorithmic framework for non-convex optimization problems over the simplex
by Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi - 91-123 Convergence study of indefinite proximal ADMM with a relaxation factor
by Min Tao - 125-161 On the resolution of misspecified convex optimization and monotone variational inequality problems
by Hesam Ahmadi & Uday V. Shanbhag - 163-182 Make $$\ell _1$$ ℓ 1 regularization effective in training sparse CNN
by Juncai He & Xiaodong Jia & Jinchao Xu & Lian Zhang & Liang Zhao - 183-212 Convergence rates of subgradient methods for quasi-convex optimization problems
by Yaohua Hu & Jiawen Li & Carisa Kwok Wai Yu - 213-249 Inverse point source location with the Helmholtz equation on a bounded domain
by Konstantin Pieper & Bao Quoc Tang & Philip Trautmann & Daniel Walter - 251-305 A second-order shape optimization algorithm for solving the exterior Bernoulli free boundary problem using a new boundary cost functional
by Julius Fergy T. Rabago & Hideyuki Azegami - 307-334 Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis
by Nicolas Delanoue & Mehdi Lhommeau & Sébastien Lagrange
July 2020, Volume 76, Issue 3
- 615-619 Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization
by Ernesto G. Birgin - 621-647 An inexact proximal generalized alternating direction method of multipliers
by V. A. Adona & M. L. N. Gonçalves & J. G. Melo - 649-673 A modified proximal point method for DC functions on Hadamard manifolds
by Yldenilson Torres Almeida & João Xavier Cruz Neto & Paulo Roberto Oliveira & João Carlos de Oliveira Souza - 675-699 The block-wise circumcentered–reflection method
by Roger Behling & J.-Yunier Bello-Cruz & Luiz-Rafael Santos - 701-736 Inexact restoration with subsampled trust-region methods for finite-sum minimization
by Stefania Bellavia & Nataša Krejić & Benedetta Morini - 737-766 An Augmented Lagrangian method for quasi-equilibrium problems
by L. F. Bueno & G. Haeser & F. Lara & F. N. Rojas - 767-800 Towards an efficient augmented Lagrangian method for convex quadratic programming
by Luís Felipe Bueno & Gabriel Haeser & Luiz-Rafael Santos - 801-833 A penalty-free method with superlinear convergence for equality constrained optimization
by Zhongwen Chen & Yu-Hong Dai & Jiangyan Liu - 835-866 Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
by M. A. Diniz-Ehrhardt & D. G. Ferreira & S. A. Santos - 867-888 Non-monotone inexact restoration method for nonlinear programming
by Juliano B. Francisco & Douglas S. Gonçalves & Fermín S. V. Bazán & Lila L. T. Paredes - 889-916 On the extension of the Hager–Zhang conjugate gradient method for vector optimization
by M. L. N. Gonçalves & L. F. Prudente - 917-933 A note on solving nonlinear optimization problems in variable precision
by S. Gratton & Ph. L. Toint - 935-959 A class of Benders decomposition methods for variational inequalities
by Juan Pablo Luna & Claudia Sagastizábal & Mikhail Solodov - 961-989 A regularization method for constrained nonlinear least squares
by Dominique Orban & Abel Soares Siqueira - 991-1019 On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems
by Mauricio Romero Sicre
June 2020, Volume 76, Issue 2
- 277-303 Numerically tractable optimistic bilevel problems
by Lorenzo Lampariello & Simone Sagratella - 305-346 An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
by Weiwei Kong & Jefferson G. Melo & Renato D. C. Monteiro - 347-380 Accelerating incremental gradient optimization with curvature information
by Hoi-To Wai & Wei Shi & César A. Uribe & Angelia Nedić & Anna Scaglione - 381-430 Inexact first-order primal–dual algorithms
by Julian Rasch & Antonin Chambolle - 431-460 Quantitative analysis for a class of two-stage stochastic linear variational inequality problems
by Jie Jiang & Xiaojun Chen & Zhiping Chen - 461-498 Algorithms for stochastic optimization with function or expectation constraints
by Guanghui Lan & Zhiqiang Zhou - 499-533 The Pontryagin maximum principle for solving Fokker–Planck optimal control problems
by Tim Breitenbach & Alfio Borzì - 535-569 Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
by Si-Tong Lu & Miao Zhang & Qing-Na Li - 571-588 A differentiable path-following algorithm for computing perfect stationary points
by Yang Zhan & Peixuan Li & Chuangyin Dang - 589-614 A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
by Kevin C. Furman & Nicolas W. Sawaya & Ignacio E. Grossmann
May 2020, Volume 76, Issue 1
- 1-31 A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
by Pooriya Beyhaghi & Ryan Alimo & Thomas Bewley - 33-68 A dual spectral projected gradient method for log-determinant semidefinite problems
by Takashi Nakagaki & Mituhiro Fukuda & Sunyoung Kim & Makoto Yamashita - 69-124 Composite convex optimization with global and local inexact oracles
by Tianxiao Sun & Ion Necoara & Quoc Tran-Dinh - 125-153 A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
by Li-Ping Pang & Qi Wu & Jin-He Wang & Qiong Wu - 155-199 Error estimates for the finite element approximation of bilinear boundary control problems
by Max Winkler - 201-232 Efficient local search procedures for quadratic fractional programming problems
by Luca Consolini & Marco Locatelli & Jiulin Wang & Yong Xia - 233-275 A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
by Patrick Mehlitz
April 2020, Volume 75, Issue 3
- 607-608 Preface to the special issue on optimization with polynomials and tensors
by Jiawang Nie - 609-628 On the tensor spectral p-norm and its dual norm via partitions
by Bilian Chen & Zhening Li - 629-647 A semidefinite relaxation method for second-order cone polynomial complementarity problems
by Lulu Cheng & Xinzhen Zhang - 649-668 Stochastic structured tensors to stochastic complementarity problems
by Shouqiang Du & Maolin Che & Yimin Wei - 669-699 On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
by Feng Guo & Xiaoxia Sun - 701-737 An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
by Shenglong Hu - 739-752 SDP relaxation algorithms for $$\mathbf {P}(\mathbf {P}_0)$$P(P0)-tensor detection
by Xiao Wang & Xinzhen Zhang & Guangming Zhou