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 76, issue 3, 2020

Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization pp. 615-619

Ernesto G. Birgin

An inexact proximal generalized alternating direction method of multipliers pp. 621-647

V. A. Adona, M. L. N. Gonçalves and J. G. Melo

A modified proximal point method for DC functions on Hadamard manifolds pp. 649-673

Yldenilson Torres Almeida, João Xavier Cruz Neto, Paulo Roberto Oliveira and João Carlos de Oliveira Souza

The block-wise circumcentered–reflection method pp. 675-699

Roger Behling, J.-Yunier Bello-Cruz and Luiz-Rafael Santos

Inexact restoration with subsampled trust-region methods for finite-sum minimization pp. 701-736

Stefania Bellavia, Nataša Krejić and Benedetta Morini

An Augmented Lagrangian method for quasi-equilibrium problems pp. 737-766

L. F. Bueno, G. Haeser, F. Lara and F. N. Rojas

Towards an efficient augmented Lagrangian method for convex quadratic programming pp. 767-800

Luís Felipe Bueno, Gabriel Haeser and Luiz-Rafael Santos

A penalty-free method with superlinear convergence for equality constrained optimization pp. 801-833

Zhongwen Chen, Yu-Hong Dai and Jiangyan Liu

Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification pp. 835-866

M. A. Diniz-Ehrhardt, D. G. Ferreira and S. A. Santos

Non-monotone inexact restoration method for nonlinear programming pp. 867-888

Juliano B. Francisco, Douglas S. Gonçalves, Fermín S. V. Bazán and Lila L. T. Paredes

On the extension of the Hager–Zhang conjugate gradient method for vector optimization pp. 889-916

M. L. N. Gonçalves and L. F. Prudente

A note on solving nonlinear optimization problems in variable precision pp. 917-933

S. Gratton and Ph. L. Toint

A class of Benders decomposition methods for variational inequalities pp. 935-959

Juan Pablo Luna, Claudia Sagastizábal and Mikhail Solodov

A regularization method for constrained nonlinear least squares pp. 961-989

Dominique Orban and Abel Soares Siqueira

On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems pp. 991-1019

Mauricio Romero Sicre

Volume 76, issue 2, 2020

Numerically tractable optimistic bilevel problems pp. 277-303

Lorenzo Lampariello and Simone Sagratella

An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems pp. 305-346

Weiwei Kong, Jefferson G. Melo and Renato D. C. Monteiro

Accelerating incremental gradient optimization with curvature information pp. 347-380

Hoi-To Wai, Wei Shi, César A. Uribe, Angelia Nedić and Anna Scaglione

Inexact first-order primal–dual algorithms pp. 381-430

Julian Rasch and Antonin Chambolle

Quantitative analysis for a class of two-stage stochastic linear variational inequality problems pp. 431-460

Jie Jiang, Xiaojun Chen and Zhiping Chen

Algorithms for stochastic optimization with function or expectation constraints pp. 461-498

Guanghui Lan and Zhiqiang Zhou

The Pontryagin maximum principle for solving Fokker–Planck optimal control problems pp. 499-533

Tim Breitenbach and Alfio Borzì

Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints pp. 535-569

Si-Tong Lu, Miao Zhang and Qing-Na Li

A differentiable path-following algorithm for computing perfect stationary points pp. 571-588

Yang Zhan, Peixuan Li and Chuangyin Dang

A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function pp. 589-614

Kevin C. Furman, Nicolas W. Sawaya and Ignacio E. Grossmann

Volume 76, issue 1, 2020

A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging pp. 1-31

Pooriya Beyhaghi, Ryan Alimo and Thomas Bewley

A dual spectral projected gradient method for log-determinant semidefinite problems pp. 33-68

Takashi Nakagaki, Mituhiro Fukuda, Sunyoung Kim and Makoto Yamashita

Composite convex optimization with global and local inexact oracles pp. 69-124

Tianxiao Sun, Ion Necoara and Quoc Tran-Dinh

A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods pp. 125-153

Li-Ping Pang, Qi Wu, Jin-He Wang and Qiong Wu

Error estimates for the finite element approximation of bilinear boundary control problems pp. 155-199

Max Winkler

Efficient local search procedures for quadratic fractional programming problems pp. 201-232

Luca Consolini, Marco Locatelli, Jiulin Wang and Yong Xia

A comparison of solution approaches for the numerical treatment of or-constrained optimization problems pp. 233-275

Patrick Mehlitz

Volume 75, issue 3, 2020

Preface to the special issue on optimization with polynomials and tensors pp. 607-608

Jiawang Nie

On the tensor spectral p-norm and its dual norm via partitions pp. 609-628

Bilian Chen and Zhening Li

A semidefinite relaxation method for second-order cone polynomial complementarity problems pp. 629-647

Lulu Cheng and Xinzhen Zhang

Stochastic structured tensors to stochastic complementarity problems pp. 649-668

Shouqiang Du, Maolin Che and Yimin Wei

On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems pp. 669-699

Feng Guo and Xiaoxia Sun

An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors pp. 701-737

Shenglong Hu

SDP relaxation algorithms for $$\mathbf {P}(\mathbf {P}_0)$$P(P0)-tensor detection pp. 739-752

Xiao Wang, Xinzhen Zhang and Guangming Zhou

Tensor neural network models for tensor singular value decompositions pp. 753-777

Xuezhong Wang, Maolin Che and Yimin Wei

Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement pp. 779-798

Mengshi Zhang, Guyan Ni and Guofeng Zhang

Higher-degree tensor eigenvalue complementarity problems pp. 799-816

Ruixue Zhao and Jinyan Fan

Saddle points of rational functions pp. 817-832

Guangming Zhou, Qin Wang and Wenjie Zhao

Volume 75, issue 2, 2020

A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs pp. 321-360

Enrico Bettiol, Lucas Létocart, Francesco Rinaldi and Emiliano Traversi

Optimally linearizing the alternating direction method of multipliers for convex programming pp. 361-388

Bingsheng He, Feng Ma and Xiaoming Yuan

Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms pp. 389-422

M. Marques Alves, Jonathan Eckstein, Marina Geremia and Jefferson G. Melo

A self-adaptive method for pseudomonotone equilibrium problems and variational inequalities pp. 423-440

Jun Yang and Hongwei Liu

Secant update version of quasi-Newton PSB with weighted multisecant equations pp. 441-466

Nicolas Boutet, Rob Haelterman and Joris Degroote

A line search exact penalty method for nonlinear semidefinite programming pp. 467-491

Qi Zhao and Zhongwen Chen

A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems pp. 493-513

Ken Kobayashi and Yuich Takano

Fast feasibility check of the multi-material vertical alignment problem in road design pp. 515-536

Dominique Monnet, Warren Hare and Yves Lucet

Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances pp. 537-560

Nazlı Dolu, Umur Hastürk and Mustafa Kemal Tural

Empirical study of exact algorithms for the multi-objective spanning tree pp. 561-605

I. F. C. Fernandes, E. F. G. Goldbarg, S. M. D. M. Maia and M. C. Goldbarg

Volume 75, issue 1, 2020

Multiscale stochastic optimization: modeling aspects and scenario generation pp. 1-34

Martin Glanzer and Georg Ch. Pflug

Markov chain block coordinate descent pp. 35-61

Tao Sun, Yuejiao Sun, Yangyang Xu and Wotao Yin

Restarting the accelerated coordinate descent method with a rough strong convexity estimate pp. 63-91

Olivier Fercoq and Zheng Qu

A global hybrid derivative-free method for high-dimensional systems of nonlinear equations pp. 93-112

Rodolfo G. Begiato, Ana L. Custódio and Márcia A. Gomes-Ruggiero

A unified convergence framework for nonmonotone inexact decomposition methods pp. 113-144

Leonardo Galli, Alessandro Galligari and Marco Sciandrone

An improved Dai–Kou conjugate gradient algorithm for unconstrained optimization pp. 145-167

Zexian Liu, Hongwei Liu and Yu-Hong Dai

Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization pp. 169-205

C. P. Brás, J. M. Martínez and M. Raydan

Modified Jacobian smoothing method for nonsmooth complementarity problems pp. 207-235

Pin-Bo Chen, Peng Zhang, Xide Zhu and Gui-Hua Lin

Rank-two update algorithm versus Frank–Wolfe algorithm with away steps for the weighted Euclidean one-center problem pp. 237-262

Wei-jie Cong, Le Wang and Hui Sun

A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems pp. 263-290

Glaydston Carvalho Bento, Sandro Dimy Barbosa Bitar, João Xavier Cruz Neto, Antoine Soubeyran and João Carlos Oliveira Souza

Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance pp. 291-320

Hanane Krim, Rachid Benmansour, David Duvivier, Daoud Aït-Kadi and Said Hanafi