Computational Optimization and Applications

2006 - 2023

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.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 56, issue 3, 2013

An efficient augmented Lagrangian method with applications to total variation minimization pp. 507-530

Chengbo Li, Wotao Yin, Hong Jiang and Yin Zhang

Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming pp. 531-558

Huixian Wu, Hezhi Luo, Xiaodong Ding and Guanting Chen

A customized proximal point algorithm for convex minimization with linear constraints pp. 559-572

Bingsheng He, Xiaoming Yuan and Wenxing Zhang

A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming pp. 573-597

María Gonzalez-Lima, Aurelio Oliveira and Danilo Oliveira

New smoothing SVM algorithm with tight error bound and efficient reduced techniques pp. 599-617

Shuisheng Zhou, Jiangtao Cui, Feng Ye, Hongwei Liu and Qiang Zhu

A two-phase heuristic for the bottleneck k-hyperplane clustering problem pp. 619-633

Edoardo Amaldi, Kanika Dhyani and Leo Liberti

Particle methods for stochastic optimal control problems pp. 635-674

Pierre Carpentier, Guy Cohen and Anes Dallagi

Three new stochastic local search algorithms for continuous optimization problems pp. 675-721

Sivashan Chetty and Aderemi Adewumi

Solving the median problem with continuous demand on a network pp. 723-734

Rafael Blanquero and Emilio Carrizosa

Landscape analysis and efficient metaheuristics for solving the n-queens problem pp. 735-764

Ellips Masehian, Hossein Akbaripour and Nasrin Mohabbati-Kalejahi

Volume 56, issue 2, 2013

Preconditioning Newton–Krylov methods in nonconvex large scale optimization pp. 253-290

Giovanni Fasano and Massimo Roma

CARTopt: a random search method for nonsmooth unconstrained optimization pp. 291-315

B. Robertson, C. Price and M. Reale

Symmetric Perry conjugate gradient method pp. 317-341

Dongyi Liu and Genqi Xu

Implementing the simplex method as a cutting-plane method, with a view to regularization pp. 343-368

Csaba Fábián, Olga Papp and Krisztián Eretnek

A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints pp. 369-403

Samuel Amstutz and Antoine Laurain

Lower and upper bounds for the spanning tree with minimum branch vertices pp. 405-438

Francesco Carrabs, Raffaele Cerulli, Manlio Gaudioso and Monica Gentili

Frequency assignment in a SDMA satellite communication system with beam decentring feature pp. 439-455

Kata Kiatmanaroj, Christian Artigues, Laurent Houssin and Frédéric Messine

Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms pp. 457-480

Mahamed Omran, Salah al-Sharhan, Ayed Salman and Maurice Clerc

The continuous differential ant-stigmergy algorithm for numerical optimization pp. 481-502

Peter Korošec and Jurij Šilc

Volume 56, issue 1, 2013

A derivative-free approximate gradient sampling algorithm for finite minimax problems pp. 1-38

W. Hare and J. Nutini

Using inexact gradients in a multilevel optimization algorithm pp. 39-61

Robert Lewis and Stephen Nash

A Shamanskii-like Levenberg-Marquardt method for nonlinear equations pp. 63-80

Jinyan Fan

A homotopy method for nonlinear semidefinite programming pp. 81-96

Li Yang and Bo Yu

Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem pp. 97-111

José Figueira, Luís Paquete, Marco Simões and Daniel Vanderpooten

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations pp. 113-130

Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram and Sergiy Butenko

Error estimates for parabolic optimal control problems with control and state constraints pp. 131-151

Wei Gong and Michael Hinze

On the optimal control of the Schlögl-model pp. 153-185

Rico Buchholz, Harald Engel, Eileen Kammann and Fredi Tröltzsch

Erratum to: On the optimal control of the Schlögl-model pp. 187-188

Rico Buchholz, Harald Engel, Eileen Kammann and Fredi Tröltzsch

Multi Agent Collaborative Search based on Tchebycheff decomposition pp. 189-208

Federico Zuiani and Massimiliano Vasile

Parameter-less algorithm for evolutionary-based optimization pp. 209-229

Gregor Papa

A simplex-based numerical framework for simple and efficient robust design optimization pp. 231-251

Pietro Congedo, Jeroen Witteveen and Gianluca Iaccarino

Volume 55, issue 3, 2013

An empirical evaluation of walk-and-round heuristics for mixed integer linear programs pp. 545-570

Kuo-Ling Huang and Sanjay Mehrotra

Parallel distributed-memory simplex for large-scale stochastic LP problems pp. 571-596

Miles Lubin, J. Hall, Cosmin Petra and Mihai Anitescu

Stochastic Nash equilibrium problems: sample average approximation and applications pp. 597-645

Huifu Xu and Dali Zhang

A cutting plane algorithm for the Capacitated Connected Facility Location Problem pp. 647-674

Stefan Gollowitzer, Bernard Gendron and Ivana Ljubić

Stable local volatility function calibration using spline kernel pp. 675-702

Thomas Coleman, Yuying Li and Cheng Wang

A new method for solving Pareto eigenvalue complementarity problems pp. 703-731

Samir Adly and Hadia Rammal

A smoothing-regularization approach to mathematical programs with vanishing constraints pp. 733-767

Wolfgang Achtziger, Tim Hoheisel and Christian Kanzow

Optimal error estimates for finite element discretization of elliptic optimal control problems with finitely many pointwise state constraints pp. 769-802

Dmitriy Leykekhman, Dominik Meidner and Boris Vexler

Volume 55, issue 2, 2013

On sample size control in sample average approximations for solving smooth stochastic programs pp. 265-309

Johannes Royset

A decomposition-based crash-start for stochastic programming pp. 311-340

Marco Colombo and Andreas Grothey

Regularized robust optimization: the optimal portfolio execution case pp. 341-377

Somayeh Moazeni, Thomas Coleman and Yuying Li

Tightening a copositive relaxation for standard quadratic optimization problems pp. 379-398

Yong Xia, Ruey-Lin Sheu, Xiaoling Sun and Duan Li

Smoothing SQP algorithm for semismooth equations with box constraints pp. 399-425

Changyu Wang, Qian Liu and Cheng Ma

Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures pp. 427-457

A. Cassioli, L. Consolini, M. Locatelli and A. Longo

On an inexact gradient method using Proper Orthogonal Decomposition for parabolic optimal control problems pp. 459-468

Christian Jörres, Georg Vossen and Michael Herty

Classification of companies using maximal margin ellipsoidal surfaces pp. 469-480

Hiroshi Konno and Masato Saito

A novel differential evolution algorithm for binary optimization pp. 481-513

Mina Husseinzadeh Kashan, Ali Husseinzadeh Kashan and Nasim Nahavandi

Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems pp. 515-544

Sergio Nesmachnow

Volume 55, issue 1, 2013

A computational study and survey of methods for the single-row facility layout problem pp. 1-20

Philipp Hungerländer and Franz Rendl

SDP reformulation for robust optimization problems based on nonconvex QP duality pp. 21-47

Ryoichi Nishimura, Shunsuke Hayashi and Masao Fukushima

A trust region method for solving semidefinite programs pp. 49-71

Aiqun Huang and Chengxian Xu

Erratum to: A trust region method for solving semidefinite programs pp. 73-73

Aiqun Huang and Chengxian Xu

Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems pp. 75-111

Quoc Tran Dinh, Carlo Savorgnan and Moritz Diehl

Mixed-Integer Linear Programming Formulations for the Software Clustering Problem pp. 113-135

Viviane Köhler, Marcia Fampa and Olinto Araújo

Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials pp. 137-153

Sabine Burgdorf, Kristijan Cafuta, Igor Klep and Janez Povh

A second-order smooth penalty function algorithm for constrained optimization problems pp. 155-172

Xinsheng Xu, Zhiqing Meng, Jianwu Sun, Liguo Huang and Rui Shen

Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization pp. 173-196

Hongwei Liu and Xiangli Li

Relaxation methods for mixed-integer optimal control of partial differential equations pp. 197-225

Falk Hante and Sebastian Sager

Vortex control of instationary channel flows using translation invariant cost functionals pp. 227-263

H. Kasumba and K. Kunisch