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 66, issue 3, 2017

Structured regularization for barrier NLP solvers pp. 401-424

Wei Wan and Lorenz T. Biegler

Adaptive smoothing algorithms for nonsmooth composite convex minimization pp. 425-451

Quoc Tran-Dinh

A robust Lagrangian-DNN method for a class of quadratic optimization problems pp. 453-479

Naohiko Arima, Sunyoung Kim, Masakazu Kojima and Kim-Chuan Toh

Partitioned quasi-Newton methods for sparse nonlinear equations pp. 481-505

Hui-Ping Cao and Dong-Hui Li

A nonmonotone Jacobian smoothing inexact Newton method for NCP pp. 507-532

Sanja Rapajić and Zoltan Papp

Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization pp. 533-556

K. Lakshmanan and Shalabh Bhatnagar

Formulating an n-person noncooperative game as a tensor complementarity problem pp. 557-576

Zheng-Hai Huang and Liqun Qi

A polynomial primal-dual affine scaling algorithm for symmetric conic optimization pp. 577-600

Ali Mohammad-Nezhad and Tamás Terlaky

Volume 66, issue 2, 2017

Local nonglobal minima for solving large-scale extended trust-region subproblems pp. 223-244

Maziar Salahi, Akram Taati and Henry Wolkowicz

On solving L-SR1 trust-region subproblems pp. 245-266

Johannes Brust, Jennifer B. Erway and Roummel F. Marcia

A semidefinite algorithm for completely positive tensor decomposition pp. 267-283

Jinyan Fan and Anwa Zhou

Computing the generalized eigenvalues of weakly symmetric tensors pp. 285-307

Na Zhao, Qingzhi Yang and Yajun Liu

Fast algorithm for singly linearly constrained quadratic programs with box-like constraints pp. 309-326

Meijiao Liu and Yong-Jin Liu

A note on the convergence of ADMM for linearly constrained convex optimization problems pp. 327-343

Liang Chen, Defeng Sun and Kim-Chuan Toh

Decomposable norm minimization with proximal-gradient homotopy algorithm pp. 345-381

Reza Eghbali and Maryam Fazel

Modeling max–min fair bandwidth allocation in BitTorrent communities pp. 383-400

Elvira Antal and Tamás Vinkó

Volume 66, issue 1, 2017

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study pp. 1-37

Ricardo M. Lima and Ignacio E. Grossmann

On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function pp. 39-73

Xingju Cai, Deren Han and Xiaoming Yuan

Modified hybrid projection methods for finding common solutions to variational inequality problems pp. 75-96

Dang Hieu, Pham Ky Anh and Le Dung Muu

Conic approximation to quadratic optimization with linear complementarity constraints pp. 97-122

Jing Zhou, Shu-Cherng Fang and Wenxun Xing

A preconditioned descent algorithm for variational inequalities of the second kind involving the p-Laplacian operator pp. 123-162

Sergio González-Andrade

Simple decentralized graph coloring pp. 163-185

Severino F. Galán

Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation pp. 187-218

Chao Ding and Hou-Duo Qi

Erratum to: A regularized Newton method without line search for unconstrained optimization pp. 219-222

Kenji Ueda and Nobuo Yamashita

Volume 65, issue 3, 2016

On handling indicator constraints in mixed integer programming pp. 545-566

Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez and Domenico Salvagnin

Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs? pp. 567-603

H. Heitsch, H. Leövey and W. Römisch

Performance of first- and second-order methods for $$\ell _1$$ ℓ 1 -regularized least squares problems pp. 605-635

Kimon Fountoulakis and Jacek Gondzio

Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support pp. 637-669

W. Ackooij, A. Frangioni and W. Oliveira

Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization pp. 671-698

Yakui Huang and Hongwei Liu

Sequential equality-constrained optimization for nonlinear programming pp. 699-721

E. G. Birgin, L. F. Bueno and J. M. Martínez

Algebraic rules for computing the regularization parameter of the Levenberg–Marquardt method pp. 723-751

Elizabeth W. Karas, Sandra A. Santos and Benar F. Svaiter

A modified Levenberg–Marquardt method with line search for nonlinear equations pp. 753-779

Liang Chen

An adaptive gradient method for computing generalized tensor eigenpairs pp. 781-797

Gaohang Yu, Zefeng Yu, Yi Xu, Yisheng Song and Yi Zhou

Spherical optimization with complex variablesfor computing US-eigenpairs pp. 799-820

Guyan Ni and Minru Bai

An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices pp. 821-844

Rafael A. Melo, Phillippe Samer and Sebastián Urrutia

Building an iterative heuristic solver for a quantum annealer pp. 845-869

Gili Rosenberg, Mohammad Vazifeh, Brad Woods and Eldad Haber

Volume 65, issue 2, 2016

Guest editorial pp. 309-311

Gianni Di Pillo and Massimo Roma

Central axes and peripheral points in high dimensional directional datasets pp. 313-338

Annabella Astorino, Manlio Gaudioso and Alberto Seeger

On the update of constraint preconditioners for regularized KKT systems pp. 339-360

Stefania Bellavia, Valentina De Simone, Daniela di Serafino and Benedetta Morini

A DIRECT-type approach for derivative-free constrained global optimization pp. 361-397

G. Di Pillo, G. Liuzzi, S. Lucidi, V. Piccialli and F. Rinaldi

A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization pp. 399-429

Giovanni Fasano and Massimo Roma

Improved error bound and a hybrid method for generalized Nash equilibrium problems pp. 431-448

Axel Dreves

Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization pp. 449-475

G. Liuzzi, S. Lucidi and V. Piccialli

Solving uniform coverage problem with a modified Remez-algorithm pp. 477-491

D. Nowak and K. H. Küfer

Reduction of affine variational inequalities pp. 493-509

Stephen M. Robinson

Perfectly competitive capacity expansion games with risk-averse participants pp. 511-539

Dane A. Schiro, Benjamin F. Hobbs and Jong-Shi Pang

Volume 65, issue 1, 2016

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings pp. 1-46

Fu Lin, Sven Leyffer and Todd Munson

A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space pp. 47-71

Marcia Fampa, Jon Lee and Wendel Melo

Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems pp. 73-92

Markus Leitner

On the global convergence of the inexact semi-smooth Newton method for absolute value equation pp. 93-108

J. Y. Bello Cruz, O. P. Ferreira and L. F. Prudente

New results on subgradient methods for strongly convex optimization problems with a unified analysis pp. 127-172

Masaru Ito

Nonconvex bundle method with application to a delamination problem pp. 173-203

Minh N. Dao, Joachim Gwinner, Dominikus Noll and Nina Ovcharova

Global minima for semilinear optimal control problems pp. 261-288

Ahmad Ahmad Ali, Klaus Deckelnick and Michael Hinze

A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems pp. 289-308

Jiawei Chen, Qamrul Hasan Ansari, Yeong-Cheng Liou and Jen-Chih Yao