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 52, issue 3, 2012

A nonmonotone filter method for nonlinear optimization pp. 583-607

Chungen Shen, Sven Leyffer and Roger Fletcher

Comparing SOS and SDP relaxations of sensor network localization pp. 609-627

João Gouveia and Ting Pong

An exact method with variable fixing for solving the generalized assignment problem pp. 629-644

Marius Posta, Jacques Ferland and Philippe Michelon

A polynomial optimization approach to constant rebalanced portfolio selection pp. 645-666

Yuichi Takano and Renata Sotirov

Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem pp. 667-689

S. Anand, S. Saravanasankar and P. Subbaraj

Vortex control in channel flows using translational invariant cost functionals pp. 691-717

H. Kasumba and K. Kunisch

Error estimates for the numerical approximation of Neumann control problems governed by a class of quasilinear elliptic equations pp. 719-756

Eduardo Casas and Vili Dhamo

Optimization of mixed variational inequalities arising in flow of viscoplastic materials pp. 757-784

Juan Reyes

A Lyusternik–Graves theorem for the proximal point method pp. 785-803

Francisco Aragón Artacho and Michaël Gaydu

Properties and construction of NCP functions pp. 805-824

Aurél Galántai

An efficient simultaneous method for the constrained multiple-sets split feasibility problem pp. 825-843

Wenxing Zhang, Deren Han and Xiaoming Yuan

PAINT: Pareto front interpolation for nonlinear multiobjective optimization pp. 845-867

Markus Hartikainen, Kaisa Miettinen and Margaret Wiecek

Volume 52, issue 2, 2012

A preconditioning technique for Schur complement systems arising in stochastic optimization pp. 315-344

Cosmin Petra and Mihai Anitescu

Scaling linear optimization problems prior to application of the simplex method pp. 345-371

Joseph Elble and Nikolaos Sahinidis

A Predictor-corrector algorithm with multiple corrections for convex quadratic programming pp. 373-391

Zhongyi Liu, Yue Chen, Wenyu Sun and Zhihui Wei

A combined class of self-scaling and modified quasi-Newton methods pp. 393-408

Mehiddin Al-Baali and Humaid Khalfan

A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei pp. 409-414

Saman Babaie-Kafaki

Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints pp. 415-437

Ming Hu and Masao Fukushima

An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures pp. 439-461

Min Tao and Xiaoming Yuan

Robust portfolio optimization: a conic programming approach pp. 463-481

Kai Ye, Panos Parpas and Berç Rustem

Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts pp. 483-506

Hanif Sherali, Evrim Dalkiran and Jitamitra Desai

Automated knowledge source selection and service composition pp. 507-535

Patrick Bless, Diego Klabjan and Soo Chang

Mixed-integer nonlinear programs featuring “on/off” constraints pp. 537-558

Hassan Hijazi, Pierre Bonami, Gérard Cornuéjols and Adam Ouorou

Optimal control of Maxwell’s equations with regularized state constraints pp. 559-581

Irwin Yousept

Volume 52, issue 1, 2012

Introduction pp. 1-2

Fredi Tröltzsch and Arnd Rösch

Finite element error estimates for Neumann boundary control problems on graded meshes pp. 3-28

Thomas Apel, Johannes Pfefferer and Arnd Rösch

Cooperation and competition in multidisciplinary optimization pp. 29-68

Jean-Antoine Désidéri

On a Kohn-Vogelius like formulation of free boundary problems pp. 69-85

Karsten Eppler and Helmut Harbrecht

Stability of semilinear elliptic optimal control problems with pointwise state constraints pp. 87-114

M. Hinze and C. Meyer

The discretizable molecular distance geometry problem pp. 115-146

Carlile Lavor, Leo Liberti, Nelson Maculan and Antonio Mucherino

Sensitivity analysis of hyperbolic optimal control problems pp. 147-179

Adam Kowalewski, Irena Lasiecka and Jan Sokołowski

Regularization for semilinear elliptic optimal control problems with pointwise state and control constraints pp. 181-207

Klaus Krumbiegel, Ira Neitzel and Arnd Rösch

Local path-following property of inexact interior methods in nonlinear programming pp. 209-238

Paul Armand, Joël Benoist and Jean-Pierre Dussault

A filter trust-region algorithm for unconstrained optimization with strong global convergence properties pp. 239-266

M. Fatemi and N. Mahdavi-Amiri

A nonmonotone PSB algorithm for solving unconstrained optimization pp. 267-280

Jiao Li, Yu-Fei Yang and Bo Yu

A numerical algorithm for finding solutions of a generalized Nash equilibrium problem pp. 281-292

Luiz Matioli, Wilfredo Sosa Sandoval and Jinyun Yuan

Numerical methods for A-optimal designs with a sparsity constraint for ill-posed inverse problems pp. 293-314

Eldad Haber, Zhuojun Magnant, Christian Lucero and Luis Tenorio

Volume 51, issue 3, 2012

Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization pp. 941-965

Ernesto Birgin and J. Martínez

Using approximate secant equations in limited memory methods for multilevel unconstrained optimization pp. 967-979

Serge Gratton, Vincent Malmedy and Philippe Toint

Inexact trust region PGC method for large sparse unconstrained optimization pp. 981-999

Junxiang Li, Limei Yan, Shudong Li and Jiazhen Huo

A constraint-reduced variant of Mehrotra’s predictor-corrector algorithm pp. 1001-1036

Luke Winternitz, Stacey Nicholls, André Tits and Dianne O’Leary

A proximal point algorithm for the monotone second-order cone complementarity problem pp. 1037-1063

Jia Wu and Jein-Shan Chen

On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints pp. 1065-1088

Yair Censor, Wei Chen, Patrick Combettes, Ran Davidi and Gabor Herman

How good are extrapolated bi-projection methods for linear feasibility problems? pp. 1089-1095

Nicholas Gould

A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem pp. 1097-1117

Hoai Le Thi, Mahdi Moeini, Tao Pham Dinh and Joaquim Judice

Reconstructing a matrix from a partial sampling of Pareto eigenvalues pp. 1119-1135

Pedro Gajardo and Alberto Seeger

Parameter identification in financial market models with a feasible point SQP algorithm pp. 1137-1161

F. Gerlich, A. Giese, J. Maruhn and E. Sachs

Non-monotone projection gradient method for non-negative matrix factorization pp. 1163-1171

Xiangli Li, Hongwei Liu and Xiuyun Zheng

Generating equidistant representations in biobjective programming pp. 1173-1210

Stacey Faulkenberg and Margaret Wiecek

A combinatorial optimization algorithm for solving the branchwidth problem pp. 1211-1229

J. Smith, Elif Ulusal and Illya Hicks

Heuristics for a project management problem with incompatibility and assignment costs pp. 1231-1252

Nicolas Zufferey, Olivier Labarthe and David Schindl

New dominance rules and exploration strategies for the 1|r i |∑U i scheduling problem pp. 1253-1274

Gio Kao, Edward Sewell, Sheldon Jacobson and Shane Hall

A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand pp. 1275-1295

Jianlin Jiang and Xiaoming Yuan

A benchmark library and a comparison of heuristic methods for the linear ordering problem pp. 1297-1317

Rafael Martí, Gerhard Reinelt and Abraham Duarte

Numerical approximation of elliptic control problems with finitely many pointwise constraints pp. 1319-1343

Eduardo Casas and Mariano Mateos

Path-following for optimal control of stationary variational inequalities pp. 1345-1373

Karl Kunisch and Daniel Wachsmuth

Capital rationing problems under uncertainty and risk pp. 1375-1396

Patrizia Beraldi, Maria Bruni and Antonio Violi

Two complexity results on c-optimality in experimental design pp. 1397-1408

Michal Černý and Milan Hladík

Volume 51, issue 2, 2012

Matrix-free interior point method pp. 457-480

Jacek Gondzio

On the local convergence of a derivative-free algorithm for least-squares minimization pp. 481-507

Hongchao Zhang and Andrew Conn

Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation pp. 509-532

Julia Higle and Lei Zhao

A local search algorithm for ray-convex polyhedron intersection pp. 533-550

Bernardo Llanas and Francisco Sáinz

A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization pp. 551-573

Sha Lu, Zengxin Wei and Lue Li

Univariate cubic L 1 interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties pp. 575-600

Qingwei Jin, Lu Yu, John Lavery and Shu-Cherng Fang

Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise pp. 601-622

Takehiko Nakama

Neural networks for solving second-order cone constrained variational inequality problem pp. 623-648

Juhe Sun, Jein-Shan Chen and Chun-Hsu Ko

Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods pp. 649-679

Bingsheng He, Li-Zhi Liao and Xiang Wang

Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments pp. 681-708

Bingsheng He, Li-Zhi Liao and Xiang Wang

Iterative methods for solving monotone equilibrium problems via dual gap functions pp. 709-728

Tran Quoc and Le Muu

Heuristics for convex mixed integer nonlinear programs pp. 729-747

Pierre Bonami and João Gonçalves

Solving VLSI design and DNA sequencing problems using bipartization of graphs pp. 749-781

Pierre Fouilhoux and A. Mahjoub

A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems pp. 783-807

Mhand Hifi and Toufik Saadi

Solving survivable two-layer network design problems by metric inequalities pp. 809-834

Sara Mattia

Multigrid second-order accurate solution of parabolic control-constrained problems pp. 835-866

S. González Andrade and A. Borzì

Virtual control regularization of state constrained linear quadratic optimal control problems pp. 867-882

Matthias Gerdts and Björn Hüpping

Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs pp. 883-908

Sven Beuchler, Clemens Pechstein and Daniel Wachsmuth

Adjoint IMEX-based schemes for control problems governed by hyperbolic conservation laws pp. 909-930

Mapundi Banda and Michael Herty

A note on the approximation of elliptic control problems with bang-bang controls pp. 931-939

Klaus Deckelnick and Michael Hinze

Volume 51, issue 1, 2012

A primal-dual augmented Lagrangian pp. 1-25

Philip Gill and Daniel Robinson

TRESNEI, a Matlab trust-region solver for systems of nonlinear equalities and inequalities pp. 27-49

Benedetta Morini and Margherita Porcelli

The impact of sampling methods on bias and variance in stochastic linear programs pp. 51-75

Michael Freimer, Jeffrey Linderoth and Douglas Thomas

Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms pp. 77-123

Ankur Kulkarni and Uday Shanbhag

Adaptive constraint reduction for convex quadratic programming pp. 125-157

Jin Jung, Dianne O’Leary and André Tits

A secant method for nonlinear least-squares minimization pp. 159-173

Wei Xu, Thomas Coleman and Gang Liu

A smoothing SQP method for nonlinear programs with stability constraints arising from power systems pp. 175-197

Xiaojiao Tong, Liqun Qi, Soon-Yi Wu and Felix Wu

Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints pp. 199-221

A. Izmailov, A. Pogosyan and M. Solodov

Overlapping restricted additive Schwarz method applied to the linear complementarity problem with an H-matrix pp. 223-239

Haijian Yang and Qingguo Li

Rank-two update algorithms for the minimum volume enclosing ellipsoid problem pp. 241-257

Wei-jie Cong, Hong-wei Liu, Feng Ye and Shui-sheng Zhou

Implementing the Nelder-Mead simplex algorithm with adaptive parameters pp. 259-277

Fuchang Gao and Lixing Han

Machine learning for global optimization pp. 279-303

A. Cassioli, D. Di Lorenzo, M. Locatelli, F. Schoen and M. Sciandrone

Monte Carlo algorithm for trajectory optimization based on Markovian readings pp. 305-321

Ronaldo Dias, Nancy Garcia and Adriano Zambom

Partitioning planar graphs: a fast combinatorial approach for max-cut pp. 323-344

F. Liers and G. Pardella

Kernel Search: a new heuristic framework for portfolio selection pp. 345-361

Enrico Angelelli, Renata Mansini and M. Speranza

A branch-and-price approach for harvest scheduling subject to maximum area restrictions pp. 363-385

Isabel Martins, Filipe Alvelos and Miguel Constantino

Semi-Lagrangian relaxation applied to the uncapacitated facility location problem pp. 387-409

C. Beltran-Royo, J.-P. Vial and A. Alonso-Ayuso

A GRASP based on DE to solve single machine scheduling problem with SDST pp. 411-435

Hanen Akrout, Bassem Jarboui, Patrick Siarry and Abdelwaheb Rebaï

An efficient label setting/correcting shortest path algorithm pp. 437-455

Antonio Sedeño-Noda and Carlos González-Martín