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.

An inexact-restoration method for nonlinear bilevel programming problems pp. 307-328: R. Andreani, S. Castro, J. Chela, A. Friedlander and S. Santos
Analytic center of spherical shells and its application to analytic center machine pp. 329-352: Fernanda Raupp and B. Svaiter
Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions pp. 353-377: Anna Heusinger and Christian Kanzow
A second-order cone cutting surface method: complexity and application pp. 379-409: Mohammad Oskoorouchi and John Mitchell
Towards auction algorithms for large dense assignment problems pp. 411-436: Libor Buš and Pavel Tvrdík
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels pp. 437-448: A. Sedeño-Noda and C. González-Martín
A combinatorial algorithm for the TDMA message scheduling problem pp. 449-463: Clayton Commander and Panos Pardalos

Sum of squares method for sensor network localization pp. 151-179: Jiawang Nie
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound pp. 181-195: Samuel Burer and Dieter Vandenbussche
A globally convergent descent method for nonsmooth variational inequalities pp. 197-211: Barbara Panicucci, Massimo Pappalardo and Mauro Passacantando
A virtual control concept for state constrained optimal control problems pp. 213-233: K. Krumbiegel and A. Rösch
Mean and variance optimization of non–linear systems and worst–case analysis pp. 235-259: P. Parpas, B. Rustem, Volker Wieland and S. Žaković
Solving the linear multiple choice knapsack problem with two objectives: profit and equity pp. 261-294: George Kozanidis
A proximal method for identifying active manifolds pp. 295-306: W. Hare

Algorithm for cardinality-constrained quadratic optimization pp. 1-22: Dimitris Bertsimas and Romy Shioda
Solving molecular distance geometry problems by global optimization algorithms pp. 23-37: Andrea Grosso, Marco Locatelli and Fabio Schoen
A cutting plane algorithm for the capacitated facility location problem pp. 39-65: Pasquale Avella and Maurizio Boccia
Scenario reduction in stochastic programming with respect to discrepancy distances pp. 67-93: René Henrion, Christian Küchler and Werner Römisch
The piecewise linear-quadratic model for computational convex analysis pp. 95-118: Yves Lucet, Heinz Bauschke and Mike Trienis
Truncated regularized Newton method for convex minimizations pp. 119-131: Ying-Jie Li and Dong-Hui Li
Finite-difference discretizations of quadratic control problems governed by ordinary elliptic differential equations pp. 133-150: Walter Alt and Nils Bräutigam

A restarting approach for the symmetric rank one update for unconstrained optimization pp. 327-334: Wah Leong and Malik Hassan
Global error bounds for the extended vertical LCP pp. 335-352: Chao Zhang, Xiaojun Chen and Naihua Xiu
Bounded-degree spanning tree problems: models and new algorithms pp. 353-370: R. Cerulli, M. Gentili and A. Iossa
Benders, metric and cutset inequalities for multicommodity capacitated network design pp. 371-392: Alysson Costa, Jean-François Cordeau and Bernard Gendron
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods pp. 393-419: José Fernández and Boglárka Tóth
Implementation of scatter search for multi-objective optimization: a comparative study pp. 421-441: R. Baños, C. Gil, J. Reca and J. Martínez
Optimal location of the support of the control for the 1-D wave equation: numerical investigations pp. 443-470: Arnaud Münch

A generalized conditional gradient method and its connection to an iterative shrinkage method pp. 173-193: Kristian Bredies, Dirk Lorenz and Peter Maass
Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities pp. 195-212: Bing-Sheng He
Kantorovich’s majorants principle for Newton’s method pp. 213-229: O. Ferreira and B. Svaiter
Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints pp. 231-264: A. Izmailov and M. Solodov
Accuracy of suboptimal solutions to kernel principal component analysis pp. 265-287: Giorgio Gnecco and Marcello Sanguineti
Optimal purchasing cycle length of a deteriorating product for intermediary firms pp. 289-301: Cheng-Kang Chen and Yi-Xiang Liao
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem pp. 303-326: M. Hifi, R. M’Hallah and T. Saadi

Inexact constraint preconditioners for linear systems arising in interior point methods pp. 137-147: Luca Bergamaschi, Jacek Gondzio, Manolo Venturin and Giovanni Zilli

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms pp. 127-128: Dmitry Belov and Ronald Armstrong