Printed from https://ideas.repec.org/s/spr/coopap2.html
Content
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 - 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