Computational Optimization and Applications

2006 - 2025

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.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 85, issue 3, 2023

Preface to the 5th Brazil–China Symposium on Applied and Computational Mathematics pp. 681-682

Jinyun Yuan

Quadratic regularization methods with finite-difference gradient approximations pp. 683-703

Geovani Nunes Grapiglia

Distributionally robust Weber problem with uncertain demand pp. 705-752

Yan Gu, Jianlin Jiang and Shun Zhang

Greedy PSB methods with explicit superlinear convergence pp. 753-786

Zhen-Yuan Ji and Yu-Hong Dai

Increasing reliability of price signals in long term energy management problems pp. 787-820

Guillaume Erbs, Clara Lage, Claudia Sagastizábal and Mikhail Solodov

Convergence of derivative-free nonmonotone Direct Search Methods for unconstrained and box-constrained mixed-integer optimization pp. 821-856

Ubaldo M. García Palomares

Conditional gradient method for vector optimization pp. 857-896

Wang Chen, Xinmin Yang and Yong Zhao

Riemannian optimization on unit sphere with p-norm and its applications pp. 897-935

Hiroyuki Sato

Inexact penalty decomposition methods for optimization problems with geometric constraints pp. 937-971

Christian Kanzow and Matteo Lapucci

Convergence rate estimates for penalty methods revisited pp. 973-992

A. F. Izmailov and M. V. Solodov

DC semidefinite programming and cone constrained DC optimization II: local search methods pp. 993-1031

M. V. Dolgopolik

A communication-efficient and privacy-aware distributed algorithm for sparse PCA pp. 1033-1072

Lei Wang, Xin Liu and Yin Zhang

Volume 85, issue 2, 2023

Branch-and-Model: a derivative-free global optimization algorithm pp. 337-367

Kaiwen Ma, Luis Miguel Rios, Atharv Bhosekar, Nikolaos V. Sahinidis and Sreekanth Rajagopalan

Results for the close-enough traveling salesman problem with a branch-and-bound algorithm pp. 369-407

Wenda Zhang, Jason J. Sauppe and Sheldon H. Jacobson

Globally optimal univariate spline approximations pp. 409-439

Robert Mohr, Maximilian Coblenz and Peter Kirst

A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints pp. 441-478

Drew P. Kouri, Mathias Staudigl and Thomas M. Surowiec

Optimal control of the stationary Kirchhoff equation pp. 479-508

Masoumeh Hashemi, Roland Herzog and Thomas M. Surowiec

An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems pp. 509-545

Weiwei Kong and Renato D. C. Monteiro

A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem pp. 547-582

Yong-Jin Liu and Jing Yu

Doubly iteratively reweighted algorithm for constrained compressed sensing models pp. 583-619

Shuqin Sun and Ting Kei Pong

Partially symmetric tensor structure preserving rank-R approximation via BFGS algorithm pp. 621-652

Ciwen Chen, Guyan Ni and Bo Yang

A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems pp. 653-679

Erfan Yazdandoost Hamedani and Afrooz Jalilzadeh

Volume 85, issue 1, 2023

An inexact Riemannian proximal gradient method pp. 1-32

Wen Huang and Ke Wei

A limited memory Quasi-Newton approach for multi-objective optimization pp. 33-73

Matteo Lapucci and Pierluigi Mansueto

A harmonic framework for stepsize selection in gradient methods pp. 75-106

Giulia Ferrandi, Michiel E. Hochstenbach and Nataša Krejić

An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems pp. 107-146

Hong T. M. Chu, Ling Liang, Kim-Chuan Toh and Lei Yang

A split Levenberg-Marquardt method for large-scale sparse problems pp. 147-179

Nataša Krejić, Greta Malaspina and Lense Swaenen

Integer set reduction for stochastic mixed-integer programming pp. 181-211

Saravanan Venkatachalam and Lewis Ntaimo

Simple approximative algorithms for free-support Wasserstein barycenters pp. 213-246

Johannes von Lindheim

A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint pp. 247-261

Zhijun Xu and Jing Zhou

An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function pp. 263-291

Ying Gao and Wenxing Zhang

A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles pp. 293-335

Johannes Schmidt and Armin Fügenschuh

Volume 84, issue 3, 2023

Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition pp. 651-702

Brian Irwin and Eldad Haber

Conic formulation of QPCCs applied to truly sparse QPs pp. 703-735

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

Jie Zhang, Xinmin Yang, Gaoxi Li and Ke Zhang

T-product factorization based method for matrix and tensor completion problems pp. 761-788

Quan Yu and Xinzhen Zhang

Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes pp. 789-831

Renaud Chicoisne

Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares pp. 833-874

Naoki Marumo, Takayuki Okuno and Akiko Takeda

A matrix nonconvex relaxation approach to unconstrained binary polynomial programs pp. 875-919

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

Claire Boyer and Antoine Godichon-Baggioni

Lifted stationary points of sparse optimization with complementarity constraints pp. 973-1003

Shisen Liu and Xiaojun Chen

A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization pp. 1005-1033

Yonggang Pei, Shaofang Song and Detong Zhu

Volume 84, issue 2, 2023

On FISTA with a relative error rule pp. 295-318

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

Silvia Bonettini, Peter Ochs, Marco Prato and Simone Rebegoldi

Inexact gradient projection method with relative error tolerance pp. 363-395

A. A. Aguiar, O. P. Ferreira and L. F. Prudente

A subgradient method with non-monotone line search pp. 397-420

O. P. Ferreira, G. N. Grapiglia, E. M. Santos and J. C. O. Souza

Loss functions for finite sets pp. 421-447

Jiawang Nie and Suhan Zhong

Efficient differentiable quadratic programming layers: an ADMM approach pp. 449-476

Andrew Butler and Roy H. Kwon

A global exact penalty for rank-constrained optimization problem and applications pp. 477-508

Zhikai Yang and Le Han

On global convergence of alternating least squares for tensor approximation pp. 509-529

Yuning Yang

Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization pp. 531-572

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

S. Gratton and Ph. L. Toint

A two-level distributed algorithm for nonconvex constrained optimization pp. 609-649

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

Valeria Ruggiero and Gerardo Toraldo

Cartoon-texture evolution for two-region image segmentation pp. 5-26

Laura Antonelli, Valentina De Simone and Marco Viola

A random time-dependent noncooperative equilibrium problem pp. 27-52

Annamaria Barbagallo and Serena Guarino Lo Bianco

A stochastic first-order trust-region method with inexact restoration for finite-sum minimization pp. 53-84

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

S. Bonettini, M. Prato and S. Rebegoldi

Constrained and unconstrained deep image prior optimization models with automatic regularization pp. 125-149

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

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

Dominik Garmatter, Margherita Porcelli, Francesco Rinaldi and Martin Stoll

Avoiding bad steps in Frank-Wolfe variants pp. 225-264

Francesco Rinaldi and Damiano Zeffiro

From inexact optimization to learning via gradient concentration pp. 265-294

Bernhard Stankewitz, Nicole Mücke and Lorenzo Rosasco