Economics at your fingertips  

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 54, issue 3, 2013

A subgradient method for multiobjective optimization pp. 461-472 Downloads
J. Cruz Neto, G. Silva, O. Ferreira and J. Lopes
Inexact projected gradient method for vector optimization pp. 473-493 Downloads
Ellen Fukuda and L. Graña Drummond
Newton-like methods for efficient solutions in vector optimization pp. 495-516 Downloads
Thai Chuong
On convex quadratic programs with linear complementarity constraints pp. 517-554 Downloads
Lijie Bai, John Mitchell and Jong-Shi Pang
Improved constraint consensus methods for seeking feasibility in nonlinear programs pp. 555-578 Downloads
Laurence Smith, John Chinneck and Victor Aitken
Variable projection for nonlinear least squares problems pp. 579-593 Downloads
Dianne O’Leary and Bert Rust
An inexact restoration strategy for the globalization of the sSQP method pp. 595-617 Downloads
D. Fernández, E. Pilotta and G. Torres
The robust network loading problem with dynamic routing pp. 619-643 Downloads
Sara Mattia
The resource-constrained modulo scheduling problem: an experimental study pp. 645-673 Downloads
Maria Ayala, Abir Benabid, Christian Artigues and Claire Hanen
A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems pp. 675-703 Downloads
Hatem Fayed and Amir Atiya
Erratum to: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems pp. 705-705 Downloads
Hatem Fayed and Amir Atiya
A penalty function-based differential evolution algorithm for constrained global optimization pp. 707-739 Downloads
Majid Ali and W. Zhu
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm pp. 741-770 Downloads
Iztok Fister, Marjan Mernik and Bogdan Filipič
Self-adaptive differential evolution incorporating a heuristic mixing of operators pp. 771-790 Downloads
Saber Elsayed, Ruhul Sarker and Daryl Essam

Volume 54, issue 2, 2013

Guest editorial pp. 211-213 Downloads
Mario Bertero, Valeria Ruggiero and Luca Zanni
A full second order variational model for multiscale texture analysis pp. 215-237 Downloads
Maïtine Bergounioux and Loïc Piffet
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems pp. 239-262 Downloads
Radu Boţ and Christopher Hendrich
Preconditioned iterative regularization in Banach spaces pp. 263-282 Downloads
Paola Brianzi, Fabio Di Benedetto and Claudio Estatico
Linear convergence analysis of the use of gradient projection methods on total variation problems pp. 283-315 Downloads
Pengwen Chen and Changfeng Gui
Bregman operator splitting with variable stepsize for total variation image reconstruction pp. 317-342 Downloads
Yunmei Chen, William Hager, Maryam Yashtini, Xiaojing Ye and Hongchao Zhang
An ADM-based splitting method for separable convex programming pp. 343-369 Downloads
Deren Han, Xiaoming Yuan, Wenxing Zhang and Xingju Cai
A class of quasi-variational inequalities for adaptive image denoising and decomposition pp. 371-398 Downloads
Frank Lenzen, Florian Becker, Jan Lellmann, Stefania Petra and Christoph Schnörr
An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography pp. 399-416 Downloads
Ignace Loris and Caroline Verhoeven
A cyclic projected gradient method pp. 417-440 Downloads
Simon Setzer, Gabriele Steidl and Jan Morgenthaler
Primal and dual alternating direction algorithms for ℓ 1 -ℓ 1 -norm minimization problems in compressive sensing pp. 441-459 Downloads
Yunhai Xiao, Hong Zhu and Soon-Yi Wu

Volume 54, issue 1, 2013

Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems pp. 1-25 Downloads
Serge Gratton, Selime Gürol and Philippe Toint
Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems pp. 27-43 Downloads
María Maciel, María Mendonça and Adriana Verdiell
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization pp. 45-64 Downloads
Gonglin Yuan, Zengxin Wei and Zhongxing Wang
Convergence and perturbation resilience of dynamic string-averaging projection methods pp. 65-76 Downloads
Yair Censor and Alexander Zaslavski
An acceleration scheme for cyclic subgradient projections method pp. 77-91 Downloads
Touraj Nikazad and Mokhtar Abbasi
A practical but rigorous approach to sum-of-ratios optimization in geometric applications pp. 93-109 Downloads
Takahito Kuno and Toshiyuki Masaki
On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere pp. 111-139 Downloads
Lei-Hong Zhang
An efficient compact quadratic convex reformulation for general integer quadratic programs pp. 141-162 Downloads
Alain Billionnet, Sourour Elloumi and Amélie Lambert
A new Branch and Bound method for a discrete truss topology design problem pp. 163-187 Downloads
Adelaide Cerveira, Agostinho Agra, Fernando Bastos and Joaquim Gromicho
A lifting method for generalized semi-infinite programs based on lower level Wolfe duality pp. 189-210 Downloads
M. Diehl, B. Houska, O. Stein and P. Steuermann

Volume 53, issue 3, 2012

Branch and cut algorithms for detecting critical nodes in undirected graphs pp. 649-680 Downloads
Marco Di Summa, Andrea Grosso and Marco Locatelli
A local relaxation method for the cardinality constrained portfolio optimization problem pp. 681-709 Downloads
Walter Murray and Howard Shek
Computing the variance of tour costs over the solution space of the TSP in polynomial time pp. 711-728 Downloads
Paul Sutcliffe, Andrew Solomon and Jenny Edwards
A computational analysis of lower bounds for big bucket production planning problems pp. 729-753 Downloads
Kerem Akartunalı and Andrew Miller
Descentwise inexact proximal algorithms for smooth optimization pp. 755-769 Downloads
Marc Fuentes, Jérôme Malick and Claude Lemaréchal
Constrained Dogleg methods for nonlinear systems with simple bounds pp. 771-794 Downloads
Stefania Bellavia, Maria Macconi and Sandra Pieraccini
A new modified nonmonotone adaptive trust region method for unconstrained optimization pp. 795-806 Downloads
Zhaocheng Cui and Boying Wu
Generalized weak sharp minima in cone-constrained convex optimization with applications pp. 807-821 Downloads
H. Luo, X. Huang and J. Peng
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization pp. 823-844 Downloads
Hayato Waki, Maho Nakata and Masakazu Muramatsu
On solving biquadratic optimization via semidefinite relaxation pp. 845-867 Downloads
Yuning Yang and Qingzhi Yang
A genetic algorithm based augmented Lagrangian method for constrained optimization pp. 869-902 Downloads
Kalyanmoy Deb and Soumil Srivastava
Computational optimization strategies for the simulation of random media and components pp. 903-931 Downloads
Edoardo Patelli and Gerhart Schuëller

Volume 53, issue 2, 2012

Guest editorial pp. 297-299 Downloads
Gianni Pillo and Massimo Roma
Margin maximization in spherical separation pp. 301-322 Downloads
Annabella Astorino, Antonio Fuduli and Manlio Gaudioso
Gap functions and penalization for solving equilibrium problems with nonlinear constraints pp. 323-346 Downloads
Giancarlo Bigi and Mauro Passacantando
Evaluating bound-constrained minimization software pp. 347-373 Downloads
Ernesto Birgin and Jan Gentil
Convergence of distributed optimal control problems governed by elliptic variational inequalities pp. 375-393 Downloads
Mahdi Boukrouche and Domingo Tarzia
An active set feasible method for large-scale minimization problems with bound constraints pp. 395-423 Downloads
M. Santis, G. Pillo and S. Lucidi
Active-set Newton methods for mathematical programs with vanishing constraints pp. 425-452 Downloads
A. Izmailov and A. Pogosyan
Interior point methods for equilibrium problems pp. 453-483 Downloads
Nils Langenberg
Approximate values for mathematical programs with variational inequality constraints pp. 485-503 Downloads
M. Lignola and Jacqueline Morgan
Derivative-free methods for bound constrained mixed-integer optimization pp. 505-526 Downloads
G. Liuzzi, S. Lucidi and F. Rinaldi
On the convergence of trust region algorithms for unconstrained minimization without derivatives pp. 527-555 Downloads
M. Powell
Convergence analysis of a proximal Gauss-Newton method pp. 557-589 Downloads
Saverio Salzo and Silvia Villa
Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems pp. 591-617 Downloads
V. Simoncini
Strong duality and minimal representations for cone optimization pp. 619-648 Downloads
Levent Tunçel and Henry Wolkowicz

Volume 53, issue 1, 2012

Updating the regularization parameter in the adaptive cubic regularization algorithm pp. 1-22 Downloads
N. Gould, M. Porcelli and P. Toint
Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints pp. 23-44 Downloads
Ting Pong
An inexact spectral bundle method for convex quadratic semidefinite programming pp. 45-89 Downloads
Huiling Lin
Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems pp. 91-113 Downloads
Ting-Jang Shiu and Soon-Yi Wu
The nearest point problem in a polyhedral set and its extensions pp. 115-130 Downloads
Zhe Liu and Yahya Fathi
An intermodal multicommodity routing problem with scheduled services pp. 131-153 Downloads
Burak Ayar and Hande Yaman
A measure space approach to optimal source placement pp. 155-171 Downloads
Christian Clason and Karl Kunisch
A general theorem on error estimates with application to a quasilinear elliptic optimal control problem pp. 173-206 Downloads
Eduardo Casas and Fredi Tröltzsch
Convergence of the forward-backward sweep method in optimal control pp. 207-226 Downloads
Michael McAsey, Libin Mou and Weimin Han
Balanced POD for linear PDE robust control computations pp. 227-248 Downloads
John Singler and Belinda Batten
A hybrid ODE-based method for unconstrained optimization problems pp. 249-270 Downloads
Yi-gui Ou and Guan-shu Wang
A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization pp. 271-295 Downloads
Abbas El Dor, Maurice Clerc and Patrick Siarry
Page updated 2023-06-03