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

An inexact regularized proximal Newton method without line search pp. 585-624

Simeon vom Dahl and Christian Kanzow

Inexact log-domain interior-point methods for quadratic programming pp. 625-658

Jordan Leung, Frank Permenter and Ilya Kolmanovsky

A stochastic moving ball approximation method for smooth convex constrained minimization pp. 659-689

Nitesh Kumar Singh and Ion Necoara

Stochastic zeroth order descent with structured directions pp. 691-727

Marco Rando, Cesare Molinari, Silvia Villa and Lorenzo Rosasco

MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization pp. 729-767

Mehri Rashidi and Majid Soleimani-damaneh

Scaled-PAKKT sequential optimality condition for multiobjective problems and its application to an Augmented Lagrangian method pp. 769-803

G. A. Carrizo, N. S. Fazzio, M. D. Sánchez and M. L. Schuverdt

A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization pp. 805-842

Qing-Rui He, Sheng-Jie Li, Bo-Ya Zhang and Chun-Rong Chen

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization pp. 843-894

Chuan He, Heng Huang and Zhaosong Lu

A power-like method for finding the spectral radius of a weakly irreducible nonnegative symmetric tensor pp. 895-926

Xueli Bai, Dong-Hui Li, Lei Wu and Jiefeng Xu

Nonsmooth projection-free optimization with functional constraints pp. 927-975

Kamiar Asgari and Michael J. Neely

Robust approximation of chance constrained optimization with polynomial perturbation pp. 977-1003

Bo Rao, Liu Yang, Suhan Zhong and Guangming Zhou

Correction: Robust approximation of chance constrained optimization with polynomial perturbation pp. 1005-1006

Bo Rao, Liu Yang, Suhan Zhong and Guangming Zhou

Volume 89, issue 2, 2024

Full-low evaluation methods for bound and linearly constrained derivative-free optimization pp. 279-315

C. W. Royer, O. Sohab and L. N. Vicente

Q-fully quadratic modeling and its application in a random subspace derivative-free method pp. 317-360

Yiwen Chen, Warren Hare and Amy Wiebe

Eigenvalue programming beyond matrices pp. 361-384

Masaru Ito and Bruno F. Lourenço

A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks pp. 385-417

Serge Gratton, Valentin Mercier, Elisa Riccietti and Philippe L. Toint

An adaptive regularized proximal Newton-type methods for composite optimization over the Stiefel manifold pp. 419-457

Qinsi Wang and Wei Hong Yang

Extragradient method with feasible inexact projection to variational inequality problem pp. 459-484

R. Díaz Millán, O. P. Ferreira and J. Ugon

Dynamic stochastic projection method for multistage stochastic variational inequalities pp. 485-516

Bin Zhou, Jie Jiang and Hailin Sun

Value of risk aversion in perishable products supply chain management pp. 517-552

Soumya Ranjan Pathy and Hamed Rahimian

The weighted Euclidean one-center problem in $${\mathbb {R}}^n$$ R n pp. 553-574

Mark E. Cawood and P. M. Dearing

Correction to: Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization pp. 575-578

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

Volume 89, issue 1, 2024

Stochastic Steffensen method pp. 1-32

Minda Zhao, Zehua Lai and Lek-Heng Lim

The Levenberg–Marquardt method: an overview of modern convergence theories and more pp. 33-67

Andreas Fischer, Alexey F. Izmailov and Mikhail V. Solodov

Handling of constraints in multiobjective blackbox optimization pp. 69-113

Jean Bigeon, Sébastien Le Digabel and Ludovic Salomon

A nonsmooth primal-dual method with interwoven PDE constraint solver pp. 115-149

Bjørn Jensen and Tuomo Valkonen

Delayed Weighted Gradient Method with simultaneous step-sizes for strongly convex optimization pp. 151-182

Hugo Lara, Rafael Aleixo and Harry Oviedo

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization pp. 183-218

Hiroki Marumo, Sunyoung Kim and Makoto Yamashita

Projected fixed-point method for vertical tensor complementarity problems pp. 219-245

Ting Zhang, Yong Wang and Zheng-Hai Huang

A non-monotone trust-region method with noisy oracles and additional sampling pp. 247-278

Nataša Krejić, Nataša Krklec Jerinkić, Ángeles Martínez and Mahsa Yousefi

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