Economics at your fingertips  

Computational Optimization and Applications

2006 - 2023

Current editor(s): William W. Hager

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 84, issue 3, 2023

Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition pp. 651-702 Downloads
Brian Irwin and Eldad Haber
Conic formulation of QPCCs applied to truly sparse QPs pp. 703-735 Downloads
Immanuel M. Bomze and Bo Peng
A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ ℓ 0 regularization problem pp. 737-760 Downloads
Jie Zhang, Xinmin Yang, Gaoxi Li and Ke Zhang
T-product factorization based method for matrix and tensor completion problems pp. 761-788 Downloads
Quan Yu and Xinzhen Zhang
Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes pp. 789-831 Downloads
Renaud Chicoisne
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares pp. 833-874 Downloads
Naoki Marumo, Takayuki Okuno and Akiko Takeda
A matrix nonconvex relaxation approach to unconstrained binary polynomial programs pp. 875-919 Downloads
Yitian Qian, Shaohua Pan and Shujun Bi
On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions pp. 921-972 Downloads
Claire Boyer and Antoine Godichon-Baggioni
Lifted stationary points of sparse optimization with complementarity constraints pp. 973-1003 Downloads
Shisen Liu and Xiaojun Chen
A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization pp. 1005-1033 Downloads
Yonggang Pei, Shaofang Song and Detong Zhu

Volume 84, issue 2, 2023

On FISTA with a relative error rule pp. 295-318 Downloads
Yunier Bello-Cruz, Max L. N. Gonçalves and Nathan Krislock
An abstract convergence framework with application to inertial inexact forward–backward methods pp. 319-362 Downloads
Silvia Bonettini, Peter Ochs, Marco Prato and Simone Rebegoldi
Inexact gradient projection method with relative error tolerance pp. 363-395 Downloads
A. A. Aguiar, O. P. Ferreira and L. F. Prudente
A subgradient method with non-monotone line search pp. 397-420 Downloads
O. P. Ferreira, G. N. Grapiglia, E. M. Santos and J. C. O. Souza
Loss functions for finite sets pp. 421-447 Downloads
Jiawang Nie and Suhan Zhong
Efficient differentiable quadratic programming layers: an ADMM approach pp. 449-476 Downloads
Andrew Butler and Roy H. Kwon
A global exact penalty for rank-constrained optimization problem and applications pp. 477-508 Downloads
Zhikai Yang and Le Han
On global convergence of alternating least squares for tensor approximation pp. 509-529 Downloads
Yuning Yang
Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization pp. 531-572 Downloads
Juan Gao, Xin-Wei Liu, Yu-Hong Dai, Yakui Huang and Junhua Gu
OFFO minimization algorithms for second-order optimality and their complexity pp. 573-607 Downloads
S. Gratton and Ph. L. Toint
A two-level distributed algorithm for nonconvex constrained optimization pp. 609-649 Downloads
Kaizhao Sun and X. Andy Sun

Volume 84, issue 1, 2023

Special issue for SIMAI 2020–2021: large-scale optimization and applications pp. 1-4 Downloads
Valeria Ruggiero and Gerardo Toraldo
Cartoon-texture evolution for two-region image segmentation pp. 5-26 Downloads
Laura Antonelli, Valentina De Simone and Marco Viola
A random time-dependent noncooperative equilibrium problem pp. 27-52 Downloads
Annamaria Barbagallo and Serena Guarino Lo Bianco
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization pp. 53-84 Downloads
Stefania Bellavia, Nataša Krejić, Benedetta Morini and Simone Rebegoldi
A nested primal–dual FISTA-like scheme for composite convex optimization problems pp. 85-123 Downloads
S. Bonettini, M. Prato and S. Rebegoldi
Constrained and unconstrained deep image prior optimization models with automatic regularization pp. 125-149 Downloads
Pasquale Cascarano, Giorgia Franchini, Erich Kobler, Federica Porta and Andrea Sebastiani
Hybrid limited memory gradient projection methods for box-constrained optimization problems pp. 151-189 Downloads
Serena Crisci, Federica Porta, Valeria Ruggiero and Luca Zanni
An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations pp. 191-223 Downloads
Dominik Garmatter, Margherita Porcelli, Francesco Rinaldi and Martin Stoll
Avoiding bad steps in Frank-Wolfe variants pp. 225-264 Downloads
Francesco Rinaldi and Damiano Zeffiro
From inexact optimization to learning via gradient concentration pp. 265-294 Downloads
Bernhard Stankewitz, Nicole Mücke and Lorenzo Rosasco

Volume 83, issue 3, 2022

COAP 2021 Best Paper Prize pp. 723-726 Downloads
Christian Kanzow and Theresa Lechner
General-purpose preconditioning for regularized interior point methods pp. 727-757 Downloads
Jacek Gondzio, Spyridon Pougkakiotis and John W. Pearson
Modeling design and control problems involving neural network surrogates pp. 759-800 Downloads
Dominic Yang, Prasanna Balaprakash and Sven Leyffer
Solving constrained nonsmooth group sparse optimization via group Capped- $$\ell _1$$ ℓ 1 relaxation and group smoothing proximal gradient algorithm pp. 801-844 Downloads
Xian Zhang and Dingtao Peng
“FISTA” in Banach spaces with adaptive discretisations pp. 845-892 Downloads
Antonin Chambolle and Robert Tovey
New Bregman proximal type algorithms for solving DC optimization problems pp. 893-931 Downloads
Shota Takahashi, Mituhiro Fukuda and Mirai Tanaka
Completely positive factorization by a Riemannian smoothing method pp. 933-966 Downloads
Zhijian Lai and Akiko Yoshise
An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis pp. 967-997 Downloads
Hao Wang, Hao Zeng and Jiashan Wang
Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions pp. 999-1026 Downloads
Scott B. Lindstrom
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs pp. 1027-1064 Downloads
Yuya Yamakawa and Takayuki Okuno

Volume 83, issue 2, 2022

Levenberg–Marquardt method based on probabilistic Jacobian models for nonlinear equations pp. 381-401 Downloads
Ruixue Zhao and Jinyan Fan
Globally convergent Newton-type methods for multiobjective optimization pp. 403-434 Downloads
M. L. N. Gonçalves, F. S. Lima and L. F. Prudente
Efficient scalarization in multiobjective optimal control of a nonsmooth PDE pp. 435-464 Downloads
Marco Bernreuther, Georg Müller and Stefan Volkwein
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces pp. 465-524 Downloads
Shisheng Cui, Uday Shanbhag, Mathias Staudigl and Phan Vuong
Minimum cost b-matching problems with neighborhoods pp. 525-553 Downloads
I. Espejo, R. Páez, J. Puerto and A. M. Rodríguez-Chía
Shortest path with acceleration constraints: complexity and approximation algorithms pp. 555-592 Downloads
S. Ardizzoni, L. Consolini, M. Laurini and M. Locatelli
A generalized shortest path tour problem with time windows pp. 593-614 Downloads
L. Di Puglia Pugliese, D. Ferone, P. Festa and F. Guerriero
Generalized Nesterov’s accelerated proximal gradient algorithms with convergence rate of order o(1/k2) pp. 615-649 Downloads
Huynh Ngai and Ta Anh Son
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems pp. 651-691 Downloads
Hongwei Liu, Ting Wang and Zexian Liu
Minimization over the $$\ell _1$$ ℓ 1 -ball using an active-set non-monotone projected gradient pp. 693-721 Downloads
Andrea Cristofari, Marianna Santis, Stefano Lucidi and Francesco Rinaldi

Volume 83, issue 1, 2022

Block coordinate descent for smooth nonconvex constrained minimization pp. 1-27 Downloads
E. G. Birgin and J. M. Martínez
Quantifying uncertainty with ensembles of surrogates for blackbox optimization pp. 29-66 Downloads
Charles Audet, Sébastien Le Digabel and Renaud Saltet
Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem pp. 67-109 Downloads
James Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis and Paula Segura
Robust min-max regret covering problems pp. 111-141 Downloads
Amadeu A. Coco, Andréa Cynthia Santos and Thiago F. Noronha
A stochastic primal-dual method for a class of nonconvex constrained optimization pp. 143-180 Downloads
Lingzi Jin and Xiao Wang
Sub-linear convergence of a stochastic proximal iteration method in Hilbert space pp. 181-210 Downloads
Monika Eisenmann, Tony Stillfjord and Måns Williamson
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming pp. 211-246 Downloads
Fabio Vitor and Todd Easton
Inertial alternating direction method of multipliers for non-convex non-smooth optimization pp. 247-285 Downloads
Le Thi Khanh Hien, Duy Nhat Phan and Nicolas Gillis
Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization pp. 287-317 Downloads
Xin Qu and Wei Bian
A product space reformulation with reduced dimension for splitting algorithms pp. 319-348 Downloads
Rubén Campoy
Abstract strongly convergent variants of the proximal point algorithm pp. 349-380 Downloads
Andrei Sipoş
Page updated 2023-03-27