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 88, issue 3, 2024

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems pp. 719-757

L. F. Prudente and D. R. Souza

An away-step Frank–Wolfe algorithm for constrained multiobjective optimization pp. 759-781

Douglas S. Gonçalves, Max L. N. Gonçalves and Jefferson G. Melo

A boosted DC algorithm for non-differentiable DC components with non-monotone line search pp. 783-818

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

Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective pp. 819-847

Yassine Laguel, Jérôme Malick and Wim Ackooij

A hybrid inexact regularized Newton and negative curvature method pp. 849-870

Hong Zhu and Yunhai Xiao

Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm pp. 871-902

N. Hoseini Monjezi, S. Nobakhtian and M. R. Pouryayevali

A generalized alternating direction method of multipliers for tensor complementarity problems pp. 903-921

Kun Liu, Anwa Zhou and Jinyan Fan

An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints pp. 923-962

Zihao Wang and Minru Bai

Shape optimization for interface identification in nonlocal models pp. 963-997

Matthias Schuster, Christian Vollmann and Volker Schulz

Correction: A Bregman–Kaczmarz method for nonlinear systems of equations pp. 999-1000

Robert Gower, Dirk A. Lorenz and Maximilian Winkler

Volume 88, issue 2, 2024

Stochastic average model methods pp. 405-442

Matt Menickelly and Stefan M. Wild

Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition pp. 443-468

Bin Gao, Renfeng Peng and Ya-xiang Yuan

Inexact direct-search methods for bilevel optimization problems pp. 469-490

Youssef Diouane, Vyacheslav Kungurtsev, Francesco Rinaldi and Damiano Zeffiro

Practical gradient and conjugate gradient methods on flag manifolds pp. 491-524

Xiaojing Zhu and Chungen Shen

A new proximal heavy ball inexact line-search algorithm pp. 525-565

S. Bonettini, M. Prato and S. Rebegoldi

Convergence of successive linear programming algorithms for noisy functions pp. 567-601

Christoph Hansknecht, Christian Kirches and Paul Manns

An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization pp. 603-641

Ruyu Liu, Shaohua Pan, Yuqia Wu and Xiaoqi Yang

An infeasible interior-point arc-search method with Nesterov’s restarting strategy for linear programming problems pp. 643-676

Einosuke Iida and Makoto Yamashita

Local convergence of primal–dual interior point methods for nonlinear semidefinite optimization using the Monteiro–Tsuchiya family of search directions pp. 677-718

Takayuki Okuno

Volume 88, issue 1, 2024

IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming pp. 1-36

Rui-Jin Zhang, Xin-Wei Liu and Yu-Hong Dai

A projected-search interior-point method for nonlinearly constrained optimization pp. 37-70

Philip E. Gill and Minxin Zhang

SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization pp. 71-106

Pourya Behmandpoor, Puya Latafat, Andreas Themelis, Marc Moonen and Panagiotis Patrinos

Coordinate descent methods beyond smoothness and separability pp. 107-149

Flavia Chorobura and Ion Necoara

A note on the convergence of deterministic gradient sampling in nonsmooth optimization pp. 151-165

Bennet Gebken

Accelerated forward–backward algorithms for structured monotone inclusions pp. 167-215

Paul-Emile Maingé and André Weng-Law

Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization pp. 217-250

Qingjie Hu, Liping Zhu and Yu Chen

Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones pp. 251-312

David E. Bernal Neira and Ignacio E. Grossmann

Convex approximations of two-stage risk-averse mixed-integer recourse models pp. 313-347

E. Ruben Beesten, Ward Romeijnders and Kees Jan Roodbergen

A benchmark generator for scenario-based discrete optimization pp. 349-378

Matheus Bernardelli Moraes and Guilherme Palermo Coelho

Efficient gradient-based optimization for reconstructing binary images in applications to electrical impedance tomography pp. 379-403

Paul R. Arbic and Vladislav Bukshtynov

Volume 87, issue 3, 2024

Preface to special issue on “optimal control of nonlinear differential equations” pp. 707-710

Christian Clason

Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension pp. 711-751

Elisabeth Diehl, Johannes Haubner, Michael Ulbrich and Stefan Ulbrich

Correction to: Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier–Stokes equations with surface tension pp. 753-754

Elisabeth Diehl, Johannes Haubner, Michael Ulbrich and Stefan Ulbrich

A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE pp. 755-784

Fabian Hoppe and Ira Neitzel

Policy iteration for Hamilton–Jacobi–Bellman equations with control constraints pp. 785-809

Sudeep Kundu and Karl Kunisch

Optimal control problems with $$L^0(\Omega )$$ L 0 ( Ω ) constraints: maximum principle and proximal gradient method pp. 811-833

Daniel Wachsmuth

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I pp. 835-891

Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager and Robert Hildebrand

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II pp. 893-934

Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager and Robert Hildebrand

The continuous stochastic gradient method: part I–convergence theory pp. 935-976

Max Grieshammer, Lukas Pflug, Michael Stingl and Andrian Uihlein

The continuous stochastic gradient method: part II–application and numerics pp. 977-1008

Max Grieshammer, Lukas Pflug, Michael Stingl and Andrian Uihlein

Correction to: The continuous stochastic gradient method: part II–application and numerics pp. 1009-1010

Max Grieshammer, Lukas Pflug, Michael Stingl and Andrian Uihlein

A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares pp. 1011-1031

Shiru Li, Tao Zhang and Yong Xia

Internet traffic tensor completion with tensor nuclear norm pp. 1033-1057

Can Li, Yannan Chen and Dong-Hui Li

A Bregman–Kaczmarz method for nonlinear systems of equations pp. 1059-1098

Robert Gower, Dirk A. Lorenz and Maximilian Winkler

Volume 87, issue 2, 2024

Multiobjective BFGS method for optimization on Riemannian manifolds pp. 337-354

Shahabeddin Najafi and Masoud Hajarian

Distribution-free algorithms for predictive stochastic programming in the presence of streaming data pp. 355-395

Shuotao Diao and Suvrajeet Sen

Stochastic projective splitting pp. 397-437

Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn and Shinjae Yoo

Correction to: Stochastic projective splitting pp. 439-439

Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn and Shinjae Yoo

Efficiency of higher-order algorithms for minimizing composite functions pp. 441-473

Yassine Nabou and Ion Necoara

A new technique to derive tight convex underestimators (sometimes envelopes) pp. 475-499

M. Locatelli

A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems pp. 501-530

Felipe Fidalgo, Emerson Castelani and Guilherme Philippi

A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique pp. 531-569

Mikhail A. Karapetyants

Linearly convergent bilevel optimization with single-step inner methods pp. 571-610

Ensio Suonperä and Tuomo Valkonen

Inexact proximal DC Newton-type method for nonconvex composite functions pp. 611-640

Shummin Nakayama, Yasushi Narushima and Hiroshi Yabe

Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming pp. 641-676

Stuart Harwood, Francisco Trespalacios, Dimitri Papageorgiou and Kevin Furman

A nested genetic algorithm strategy for an optimal seismic design of frames pp. 677-704

A. Greco, F. Cannizzaro, R. Bruno and A. Pluchino

Correction: On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions pp. 705-706

Claire Boyer and Antoine Godichon‑Baggioni

Volume 87, issue 1, 2024

Inexact proximal Newton methods in Hilbert spaces pp. 1-37

Bastian Pötzl, Anton Schiela and Patrick Jaap

Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming pp. 39-81

Shiwei Wang and Chao Ding

A successive centralized circumcentered-reflection method for the convex feasibility problem pp. 83-116

Roger Behling, Yunier Bello-Cruz, Alfredo Iusem, Di Liu and Luiz-Rafael Santos

Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization pp. 117-147

Zichong Li, Pin-Yu Chen, Sijia Liu, Songtao Lu and Yangyang Xu

A trust-region approach for computing Pareto fronts in multiobjective optimization pp. 149-179

A. Mohammadi and A. L. Custódio

From Halpern’s fixed-point iterations to Nesterov’s accelerated interpretations for root-finding problems pp. 181-218

Quoc Tran-Dinh

Generalizations of the proximal method of multipliers in convex optimization pp. 219-247

R. Tyrrell Rockafellar

Distributed stochastic compositional optimization problems over directed networks pp. 249-288

Shengchao Zhao and Yongchao Liu

A modified inexact Levenberg–Marquardt method with the descent property for solving nonlinear equations pp. 289-322

Jianghua Yin, Jinbao Jian and Guodong Ma

An easily computable upper bound on the Hoffman constant for homogeneous inequality systems pp. 323-335

Javier F. Peña