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.

Interval propagation and search on directed acyclic graphs for numerical constraint solving pp. 499-531: Xuan-Ha Vu, Hermann Schichl and Djamila Sam-Haroud
Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint pp. 533-549: Harish Palanthandalam-Madapusi, Tobin Van Pelt and Dennis Bernstein
Set containment characterization for quasiconvex programming pp. 551-563: Satoshi Suzuki and Daishi Kuroiwa
On the existence of solutions to quasivariational inclusion problems pp. 565-581: Nguyen Hai, Phan Khanh and Nguyen Quan
Stability of semi-infinite vector optimization problems under functional perturbations pp. 583-595: T. Chuong, N. Huy and J. Yao
Equivalence theorem, consistency and axiomatizations of a multi-choice value pp. 597-613: Yan-An Hwang and Yu-Hsien Liao
Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions pp. 615-629: Qingxiang Zhang
Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization pp. 631-644: Paul-Emile Maingé
On optimal zero-preserving corrections for inconsistent linear systems pp. 645-666: Paula Amaral, Luís Fernandes, Joaquim Júdice and Hanif Sherali

Efficient preprocessing for VLSI optimization problems pp. 475-493: W. Hare, M. Liu and T. Terlaky
New approach for the nonlinear programming with transient stability constraints arising from power systems pp. 495-520: Xiaojiao Tong, Soon-Yi Wu and Renjun Zhou
A penalized nonparametric method for nonlinear constrained optimization based on noisy data pp. 521-541: Ronaldo Dias, Nancy Garcia and Adriano Zambom
A computational study of exact knapsack separation for the generalized assignment problem pp. 543-555: Pasquale Avella, Maurizio Boccia and Igor Vasilyev
Smoothing algorithms for complementarity problems over symmetric cones pp. 557-579: Zheng-Hai Huang and Tie Ni
A one-parametric class of merit functions for the second-order cone complementarity problem pp. 581-606: Jein-Shan Chen and Shaohua Pan
Solving chance-constrained combinatorial problems to optimality pp. 607-638: Olivier Klopfenstein
Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions pp. 639-661: Akbar Karimi, Hadi Nobahari and Patrick Siarry

An inexact modified subgradient algorithm for nonconvex optimization pp. 1-24: Regina Burachik, C. Kaya and Musa Mammadov
Cone-constrained eigenvalue problems: theory and algorithms pp. 25-57: A. Pinto da Costa and A. Seeger
A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions pp. 59-88: Shaohua Pan and Jein-Shan Chen
Some projection-like methods for the generalized Nash equilibria pp. 89-109: Jianzhong Zhang, Biao Qu and Naihua Xiu
Heuristics for the facility location and design (1|1)-centroid problem on the plane pp. 111-141: J. Redondo, J. Fernández, I. García and P. Ortigosa
Fast paths in large-scale dynamic road networks pp. 143-158: Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob and Leo Liberti
An algorithm for the estimation of a regression function by continuous piecewise linear functions pp. 159-179: Adil Bagirov, Conny Clausen and Michael Kohler
OSiL: An instance language for optimization pp. 181-203: Robert Fourer, Jun Ma and Kipp Martin

On equivalent reformulations for absolute value equations pp. 363-372: Oleg Prokopyev
Improved convergence order for augmented penalty algorithms pp. 373-383: Jean-Pierre Dussault
A bundle-type algorithm for routing in telecommunication data networks pp. 385-409: Claude Lemaréchal, Adam Ouorou and Georgios Petrou
Hybrid heuristics for the maximum diversity problem pp. 411-426: Micael Gallego, Abraham Duarte, Manuel Laguna and Rafael Martí
Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems pp. 427-441: Elizabeth Karas, Elvio Pilotta and Ademir Ribeiro
A successive SDP-NSDP approach to a robust optimization problem in finance pp. 443-466: F. Leibfritz and J. Maruhn
An incomplete Hessian Newton minimization method and its application in a chemical database problem pp. 467-485: Dexuan Xie and Qin Ni
New facets for the two-stage uncapacitated facility location polytope pp. 487-519: Mercedes Landete and Alfredo Marín
COAP 2008 best paper award: Paper of M. Weiser, T. Gänzler, and A. Schiela pp. 521-524: W. Hager
COAP 2008 best paper award: Paper of P.M. Hahn, B.-J. Kim, M. Guignard, J.M. Smith and Y.-R. Zhu pp. 525-530: W. Hager

Elliptic optimal control problems with L 1 -control cost and applications for the placement of control devices pp. 159-181: Georg Stadler
Regularization of state-constrained elliptic optimal control problems with nonlocal radiation interface conditions pp. 183-212: C. Meyer and I. Yousept
A stable primal–dual approach for linear programming under nondegeneracy assumptions pp. 213-247: Maria Gonzalez-Lima, Hua Wei and Henry Wolkowicz
Scalarizations for adaptively solving multi-objective optimization problems pp. 249-273: Gabriele Eichfelder
A FPTAS for a class of linear multiplicative problems pp. 275-288: Daniele Depetrini and Marco Locatelli
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem pp. 289-313: Dulce Rosas, Jordi Castro and Lídia Montero
Global optimization of truss topology with discrete bar areas—Part II: Implementation and numerical results pp. 315-341: Wolfgang Achtziger and Mathias Stolpe
Computing the metric dimension of graphs by genetic algorithms pp. 343-361: Jozef Kratica, Vera Kovačević-Vujčić and Mirjana Čangalović

Editorial pp. 1-2: Fredi Tröltzsch
A posteriori error estimation and adaptivity for elliptic optimal control problems with state constraints pp. 3-25: Olaf Benedix and Boris Vexler
Error estimates for the discretization of elliptic control problems with pointwise control and state constraints pp. 27-55: S. Cherednichenko and A. Rösch
Sensitivity analysis and the adjoint update strategy for an optimal control problem with mixed control-state constraints pp. 57-81: Roland Griesse and Daniel Wachsmuth
POD a-posteriori error estimates for linear-quadratic optimal control problems pp. 83-115: F. Tröltzsch and S. Volkwein
On solving the Lagrangian dual of integer programs via an incremental approach pp. 117-138: Manlio Gaudioso, Giovanni Giallombardo and Giovanna Miglionico
A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty pp. 139-158: Wang Yanjun, Li Tao and Liang Zhian