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 78, issue 3, 2021

Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games pp. 675-704

Pedro Borges, Claudia Sagastizábal and Mikhail Solodov

Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces pp. 705-740

Caroline Geiersbach and Teresa Scarinci

Conditional gradient method for multiobjective optimization pp. 741-768

P. B. Assunção, O. P. Ferreira and L. F. Prudente

The Tikhonov regularization for vector equilibrium problems pp. 769-792

Lam Quoc Anh, Tran Quoc Duy, Le Dung Muu and Truong Van Tri

Gauss–Newton-type methods for bilevel optimization pp. 793-824

Jörg Fliege, Andrey Tin and Alain Zemkoho

A proximal DC approach for quadratic assignment problem pp. 825-851

Zhuoxuan Jiang, Xinyuan Zhao and Chao Ding

A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem pp. 853-891

Xinxin Li, Ting Kei Pong, Hao Sun and Henry Wolkowicz

Polyhedral approximations of the semidefinite cone and their application pp. 893-913

Yuzhu Wang, Akihiro Tanaka and Akiko Yoshise

On the properties of the cosine measure and the uniform angle subspace pp. 915-952

Rommel G. Regis

Secant Update generalized version of PSB: a new approach pp. 953-982

Nicolas Boutet, Rob Haelterman and Joris Degroote

Volume 78, issue 2, 2021

An interior point-proximal method of multipliers for convex quadratic programming pp. 307-351

Spyridon Pougkakiotis and Jacek Gondzio

Using partial spectral information for block diagonal preconditioning of saddle-point systems pp. 353-375

Alison Ramage, Daniel Ruiz, Annick Sartenaer and Charlotte Tannier

Globalized inexact proximal Newton-type methods for nonconvex composite functions pp. 377-410

Christian Kanzow and Theresa Lechner

Nonconvex robust programming via value-function optimization pp. 411-450

Ying Cui, Ziyu He and Jong-Shi Pang

A bundle method for nonsmooth DC programming with application to chance-constrained problems pp. 451-490

W. Ackooij, S. Demassey, P. Javal, H. Morais, W. Oliveira and B. Swaminathan

Finding multi-objective supported efficient spanning trees pp. 491-528

Pedro Correia, Luís Paquete and José Rui Figueira

The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials pp. 529-557

Jiawang Nie, Xindong Tang and Lingling Xu

Tensor Z-eigenvalue complementarity problems pp. 559-573

Meilan Zeng

On mixed-integer optimal control with constrained total variation of the integer control pp. 575-623

Sebastian Sager and Clemens Zeile

Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization pp. 625-674

Alain B. Zemkoho and Shenglong Zhou

Volume 78, issue 1, 2021

An accelerated active-set algorithm for a quadratic semidefinite program with general constraints pp. 1-42

Chungen Shen, Yunlong Wang, Wenjuan Xue and Lei-Hong Zhang

Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$ ℓ 0 -minimization problems pp. 43-85

Yue Xie and Uday V. Shanbhag

Convergence study on strictly contractive Peaceman–Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms pp. 87-124

Peixuan Li, Yuan Shen, Suhong Jiang, Zehua Liu and Caihua Chen

Single-forward-step projective splitting: exploiting cocoercivity pp. 125-166

Patrick R. Johnstone and Jonathan Eckstein

Properties of the delayed weighted gradient method pp. 167-180

Roberto Andreani and Marcos Raydan

Implementing and modifying Broyden class updates for large scale optimization pp. 181-203

Martin Buhmann and Dirk Siegel

Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems pp. 205-238

Yannan Chen, Hailin Sun and Huifu Xu

T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming pp. 239-272

Meng-Meng Zheng, Zheng-Hai Huang and Yong Wang

Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations pp. 273-286

A. Fischer, A. F. Izmailov and M. V. Solodov

An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem pp. 287-306

Weiwei Pan, Jingjing Shen and Zi Xu

Volume 77, issue 3, 2020

Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton’s equation pp. 627-651

Andrea Caliciotti, Giovanni Fasano, Florian Potra and Massimo Roma

Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods pp. 653-710

Nicolas Loizou and Peter Richtárik

A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem pp. 711-728

Masao Fukushima, Joaquim Júdice, Welington Oliveira and Valentina Sessa

Convergence rates for an inexact ADMM applied to separable convex optimization pp. 729-754

William W. Hager and Hongchao Zhang

A proximal-point outer approximation algorithm pp. 755-777

Massimo De Mauri, Joris Gillis, Jan Swevers and Goele Pipeleers

Riemannian conjugate gradient methods with inverse retraction pp. 779-810

Xiaojing Zhu and Hiroyuki Sato

Hybrid Riemannian conjugate gradient methods with global convergence properties pp. 811-830

Hiroyuki Sakai and Hideaki Iiduka

A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems pp. 831-869

Veronika Karl, Ira Neitzel and Daniel Wachsmuth

Expected residual minimization method for monotone stochastic tensor complementarity problem pp. 871-896

Zhenyu Ming, Liping Zhang and Liqun Qi

On the use of polynomial models in multiobjective directional direct search pp. 897-918

C. P. Brás and A. L. Custódio

Volume 77, issue 2, 2020

An explicit Tikhonov algorithm for nested variational inequalities pp. 335-350

Lorenzo Lampariello, Christoph Neumann, Jacopo M. Ricci, Simone Sagratella and Oliver Stein

On the interplay between acceleration and identification for the proximal gradient algorithm pp. 351-378

Gilles Bareilles and Franck Iutzeler

A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions pp. 379-409

M. Maleknia and M. Shamsi

Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization pp. 411-432

Yunmei Chen, Xiaojing Ye and Wei Zhang

A variation of Broyden class methods using Householder adaptive transforms pp. 433-463

S. Cipolla, C. Di Fiore and P. Zellini

The distance between convex sets with Minkowski sum structure: application to collision detection pp. 465-490

Xiangfeng Wang, Junping Zhang and Wenxing Zhang

Weak convergence of iterative methods for solving quasimonotone variational inequalities pp. 491-508

Hongwei Liu and Jun Yang

On a numerical shape optimization approach for a class of free boundary problems pp. 509-537

A. Boulkhemair, A. Chakib, A. Nachaoui, A. A. Niftiyev and A. Sadik

Oracle-based algorithms for binary two-stage robust optimization pp. 539-569

Nicolas Kämmerling and Jannis Kurtz

Global optimization via inverse distance weighting and radial basis functions pp. 571-595

Alberto Bemporad

Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation pp. 597-616

Siamak Akbarzadeh, Jan Hückelheim and Jens-Dominik Müller

Volume 77, issue 1, 2020

On the convergence of steepest descent methods for multiobjective optimization pp. 1-27

G. Cocchi, G. Liuzzi, S. Lucidi and M. Sciandrone

An augmented Lagrangian algorithm for multi-objective optimization pp. 29-56

G. Cocchi and M. Lapucci

An active-set algorithmic framework for non-convex optimization problems over the simplex pp. 57-89

Andrea Cristofari, Marianna Santis, Stefano Lucidi and Francesco Rinaldi

Convergence study of indefinite proximal ADMM with a relaxation factor pp. 91-123

Min Tao

On the resolution of misspecified convex optimization and monotone variational inequality problems pp. 125-161

Hesam Ahmadi and Uday V. Shanbhag

Make $$\ell _1$$ ℓ 1 regularization effective in training sparse CNN pp. 163-182

Juncai He, Xiaodong Jia, Jinchao Xu, Lian Zhang and Liang Zhao

Convergence rates of subgradient methods for quasi-convex optimization problems pp. 183-212

Yaohua Hu, Jiawen Li and Carisa Kwok Wai Yu

Inverse point source location with the Helmholtz equation on a bounded domain pp. 213-249

Konstantin Pieper, Bao Quoc Tang, Philip Trautmann and Daniel Walter

A second-order shape optimization algorithm for solving the exterior Bernoulli free boundary problem using a new boundary cost functional pp. 251-305

Julius Fergy T. Rabago and Hideyuki Azegami

Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis pp. 307-334

Nicolas Delanoue, Mehdi Lhommeau and Sébastien Lagrange