Printed from https://ideas.repec.org/s/spr/coopap3.html
Content
July 2021, Volume 79, Issue 3
- 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 - 753-777 Tensor neural network models for tensor singular value decompositions
by Xuezhong Wang & Maolin Che & Yimin Wei - 779-798 Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
by Mengshi Zhang & Guyan Ni & Guofeng Zhang - 799-816 Higher-degree tensor eigenvalue complementarity problems
by Ruixue Zhao & Jinyan Fan - 817-832 Saddle points of rational functions
by Guangming Zhou & Qin Wang & Wenjie Zhao
March 2020, Volume 75, Issue 2
- 321-360 A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
by Enrico Bettiol & Lucas Létocart & Francesco Rinaldi & Emiliano Traversi - 361-388 Optimally linearizing the alternating direction method of multipliers for convex programming
by Bingsheng He & Feng Ma & Xiaoming Yuan - 389-422 Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
by M. Marques Alves & Jonathan Eckstein & Marina Geremia & Jefferson G. Melo - 423-440 A self-adaptive method for pseudomonotone equilibrium problems and variational inequalities
by Jun Yang & Hongwei Liu - 441-466 Secant update version of quasi-Newton PSB with weighted multisecant equations
by Nicolas Boutet & Rob Haelterman & Joris Degroote - 467-491 A line search exact penalty method for nonlinear semidefinite programming
by Qi Zhao & Zhongwen Chen - 493-513 A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
by Ken Kobayashi & Yuich Takano - 515-536 Fast feasibility check of the multi-material vertical alignment problem in road design
by Dominique Monnet & Warren Hare & Yves Lucet - 537-560 Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances
by Nazlı Dolu & Umur Hastürk & Mustafa Kemal Tural - 561-605 Empirical study of exact algorithms for the multi-objective spanning tree
by I. F. C. Fernandes & E. F. G. Goldbarg & S. M. D. M. Maia & M. C. Goldbarg
January 2020, Volume 75, Issue 1
- 1-34 Multiscale stochastic optimization: modeling aspects and scenario generation
by Martin Glanzer & Georg Ch. Pflug - 35-61 Markov chain block coordinate descent
by Tao Sun & Yuejiao Sun & Yangyang Xu & Wotao Yin - 63-91 Restarting the accelerated coordinate descent method with a rough strong convexity estimate
by Olivier Fercoq & Zheng Qu - 93-112 A global hybrid derivative-free method for high-dimensional systems of nonlinear equations
by Rodolfo G. Begiato & Ana L. Custódio & Márcia A. Gomes-Ruggiero - 113-144 A unified convergence framework for nonmonotone inexact decomposition methods
by Leonardo Galli & Alessandro Galligari & Marco Sciandrone - 145-167 An improved Dai–Kou conjugate gradient algorithm for unconstrained optimization
by Zexian Liu & Hongwei Liu & Yu-Hong Dai - 169-205 Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
by C. P. Brás & J. M. Martínez & M. Raydan - 207-235 Modified Jacobian smoothing method for nonsmooth complementarity problems
by Pin-Bo Chen & Peng Zhang & Xide Zhu & Gui-Hua Lin - 237-262 Rank-two update algorithm versus Frank–Wolfe algorithm with away steps for the weighted Euclidean one-center problem
by Wei-jie Cong & Le Wang & Hui Sun - 263-290 A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
by Glaydston Carvalho Bento & Sandro Dimy Barbosa Bitar & João Xavier Cruz Neto & Antoine Soubeyran & João Carlos Oliveira Souza - 291-320 Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance
by Hanane Krim & Rachid Benmansour & David Duvivier & Daoud Aït-Kadi & Said Hanafi
December 2019, Volume 74, Issue 3
- 627-643 Solution refinement at regular points of conic problems
by Enzo Busseti & Walaa M. Moursi & Stephen Boyd - 645-667 Mesh adaptive direct search with simplicial Hessian update
by Árpád Bűrmen & Iztok Fajfar - 669-701 Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints
by Johannes J. Brust & Roummel F. Marcia & Cosmin G. Petra - 703-728 Exact spectral-like gradient method for distributed optimization
by Dušan Jakovetić & Nataša Krejić & Nataša Krklec Jerinkić - 729-746 A delayed weighted gradient method for strictly convex quadratic minimization
by Harry Fernando Oviedo Leon - 747-778 Douglas–Rachford splitting and ADMM for pathological convex optimization
by Ernest K. Ryu & Yanli Liu & Wotao Yin - 779-820 Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
by Aswin Kannan & Uday V. Shanbhag - 821-850 Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
by Xiaolong Qin & Nguyen Thai An - 851-893 An auction-based approach for the re-optimization shortest path tree problem
by P. Festa & F. Guerriero & A. Napoletano - 895-918 Two new integer linear programming formulations for the vertex bisection problem
by Norberto Castillo-García & Paula Hernández Hernández - 919-948 An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
by Leonardo Di Gangi & M. Lapucci & F. Schoen & A. Sortino - 949-949 Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
by Zhi Wang & K. Droegemeier & L. White
November 2019, Volume 74, Issue 2
- 317-344 On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
by Hikaru Komeiji & Sunyoung Kim & Makoto Yamashita - 345-385 Additive and restricted additive Schwarz–Richardson methods for inequalities with nonlinear monotone operators
by Lori Badea - 387-441 Computing the spark: mixed-integer programming for the (vector) matroid girth problem
by Andreas M. Tillmann - 443-480 A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
by Najmeh Hoseini Monjezi & S. Nobakhtian - 481-516 A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
by Jingqun Li & R. Tharmarasa & Daly Brown & Thia Kirubarajan & Krishna R. Pattipati - 517-545 Minimizing the average searching time for an object within a graph
by Ron Teller & Moshe Zofi & Moshe Kaspi - 547-582 Modified inexact Levenberg–Marquardt methods for solving nonlinear least squares problems
by Jifeng Bao & Carisa Kwok Wai Yu & Jinhua Wang & Yaohua Hu & Jen-Chih Yao - 583-621 Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence
by Chee-Khian Sim
September 2019, Volume 74, Issue 1
- 1-42 On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
by Wim Ackooij & Welington Oliveira & Yongjia Song - 43-65 A family of spectral gradient methods for optimization
by Yu-Hong Dai & Yakui Huang & Xin-Wei Liu - 67-92 Non-stationary Douglas–Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
by Dirk A. Lorenz & Quoc Tran-Dinh - 93-120 Quasi-Newton approaches to interior point methods for quadratic problems
by J. Gondzio & F. N. C. Sobral - 121-142 A dense initialization for limited-memory quasi-Newton methods
by Johannes Brust & Oleg Burdakov & Jennifer B. Erway & Roummel F. Marcia - 143-176 Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
by Yiran Cui & Keiichi Morikuni & Takashi Tsuchiya & Ken Hayami - 177-194 A subspace SQP method for equality constrained optimization
by Jae Hwa Lee & Yoon Mo Jung & Ya-xiang Yuan & Sangwoon Yun - 195-223 A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
by A. Taati & M. Salahi - 225-258 A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs
by Pedro Merino - 259-273 Bounds for integration matrices that arise in Gauss and Radau collocation
by Wanchun Chen & Wenhao Du & William W. Hager & Liang Yang - 275-314 Convergence rate for a Radau hp collocation method applied to constrained optimal control
by William W. Hager & Hongyan Hou & Subhashree Mohapatra & Anil V. Rao & Xiang-Sheng Wang - 315-316 Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control
by William W. Hager & Hongyan Hou & Subhashree Mohapatra & Anil V. Rao & Xiang-Sheng Wang
July 2019, Volume 73, Issue 3
- 707-753 A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
by E. G. Birgin & J. M. Martínez - 755-790 Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces
by Eike Börgens & Christian Kanzow - 791-819 Robust optimal discrete arc sizing for tree-shaped potential networks
by Martin Robinius & Lars Schewe & Martin Schmidt & Detlef Stolten & Johannes Thürauf & Lara Welder - 821-837 An algorithm for equilibrium selection in generalized Nash equilibrium problems
by Axel Dreves - 839-869 A parameterized Douglas–Rachford algorithm
by Dongying Wang & Xianfu Wang - 871-901 On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
by Feng Ma - 903-912 A simple convergence analysis of Bregman proximal gradient algorithm
by Yi Zhou & Yingbin Liang & Lixin Shen - 913-932 Modified extragradient-like algorithms with new stepsizes for variational inequalities
by Dang Hieu & Pham Ky Anh & Le Dung Muu - 933-956 The Uzawa-MBB type algorithm for nonsymmetric saddle point problems
by Zhitao Xu & Li Gao - 957-996 Convergence of a stabilized SQP method for equality constrained optimization
by Songqiang Qiu - 997-1017 Maximum–norm a posteriori error estimates for an optimal control problem
by Enrique Otárola & Richard Rankin & Abner J. Salgado - 1019-1019 Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
by Zhi Wang & K. Droegemeier & L. White
June 2019, Volume 73, Issue 2
- 353-386 Iteratively reweighted $$\ell _1$$ ℓ 1 algorithms with extrapolation
by Peiran Yu & Ting Kei Pong - 387-410 Empirical risk minimization: probabilistic complexity and stepsize strategy
by Chin Pang Ho & Panos Parpas - 411-452 An almost cyclic 2-coordinate descent method for singly linearly constrained problems
by Andrea Cristofari - 453-476 A singular value p-shrinkage thresholding algorithm for low rank matrix recovery
by Yu-Fan Li & Kun Shang & Zheng-Hai Huang - 477-508 A semismooth Newton method for support vector classification and regression
by Juan Yin & Qingna Li - 509-534 A sub-additive DC approach to the complementarity problem
by L. Abdallah & M. Haddou & T. Migot - 535-574 Optimized choice of parameters in interior-point methods for linear programming
by Luiz-Rafael Santos & Fernando Villas-Bôas & Aurelio R. L. Oliveira & Clovis Perin