Economics at your fingertips  

Computational Optimization and Applications

2006 - 2017

Current editor(s): William W. Hager

From Springer
Series data maintained by Sonal Shukla ().

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 66, issue 1, 2017

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study pp. 1-37 Downloads
Ricardo M. Lima and Ignacio E. Grossmann
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function pp. 39-73 Downloads
Xingju Cai, Deren Han and Xiaoming Yuan
Modified hybrid projection methods for finding common solutions to variational inequality problems pp. 75-96 Downloads
Dang Hieu, Pham Ky Anh and Le Dung Muu
Conic approximation to quadratic optimization with linear complementarity constraints pp. 97-122 Downloads
Jing Zhou, Shu-Cherng Fang and Wenxun Xing
A preconditioned descent algorithm for variational inequalities of the second kind involving the p-Laplacian operator pp. 123-162 Downloads
Sergio González-Andrade
Simple decentralized graph coloring pp. 163-185 Downloads
Severino F. Galán
Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation pp. 187-218 Downloads
Chao Ding and Hou-Duo Qi
Erratum to: A regularized Newton method without line search for unconstrained optimization pp. 219-222 Downloads
Kenji Ueda and Nobuo Yamashita

Volume 65, issue 3, 2016

On handling indicator constraints in mixed integer programming pp. 545-566 Downloads
Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez and Domenico Salvagnin
Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs? pp. 567-603 Downloads
H. Heitsch, H. Leövey and W. Römisch
Performance of first- and second-order methods for $$\ell _1$$ ℓ 1 -regularized least squares problems pp. 605-635 Downloads
Kimon Fountoulakis and Jacek Gondzio
Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support pp. 637-669 Downloads
W. Ackooij, A. Frangioni and W. Oliveira
Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization pp. 671-698 Downloads
Yakui Huang and Hongwei Liu
Sequential equality-constrained optimization for nonlinear programming pp. 699-721 Downloads
E. G. Birgin, L. F. Bueno and J. M. Martínez
Algebraic rules for computing the regularization parameter of the Levenberg–Marquardt method pp. 723-751 Downloads
Elizabeth W. Karas, Sandra A. Santos and Benar F. Svaiter
A modified Levenberg–Marquardt method with line search for nonlinear equations pp. 753-779 Downloads
Liang Chen
An adaptive gradient method for computing generalized tensor eigenpairs pp. 781-797 Downloads
Gaohang Yu, Zefeng Yu, Yi Xu, Yisheng Song and Yi Zhou
Spherical optimization with complex variablesfor computing US-eigenpairs pp. 799-820 Downloads
Guyan Ni and Minru Bai
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices pp. 821-844 Downloads
Rafael A. Melo, Phillippe Samer and Sebastián Urrutia
Building an iterative heuristic solver for a quantum annealer pp. 845-869 Downloads
Gili Rosenberg, Mohammad Vazifeh, Brad Woods and Eldad Haber

Volume 65, issue 2, 2016

Guest editorial pp. 309-311 Downloads
Gianni Di Pillo and Massimo Roma
Central axes and peripheral points in high dimensional directional datasets pp. 313-338 Downloads
Annabella Astorino, Manlio Gaudioso and Alberto Seeger
On the update of constraint preconditioners for regularized KKT systems pp. 339-360 Downloads
Stefania Bellavia, Valentina De Simone, Daniela di Serafino and Benedetta Morini
A DIRECT-type approach for derivative-free constrained global optimization pp. 361-397 Downloads
G. Di Pillo, G. Liuzzi, S. Lucidi, V. Piccialli and F. Rinaldi
A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization pp. 399-429 Downloads
Giovanni Fasano and Massimo Roma
Improved error bound and a hybrid method for generalized Nash equilibrium problems pp. 431-448 Downloads
Axel Dreves
Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization pp. 449-475 Downloads
G. Liuzzi, S. Lucidi and V. Piccialli
Solving uniform coverage problem with a modified Remez-algorithm pp. 477-491 Downloads
D. Nowak and K. H. Küfer
Reduction of affine variational inequalities pp. 493-509 Downloads
Stephen M. Robinson
Perfectly competitive capacity expansion games with risk-averse participants pp. 511-539 Downloads
Dane A. Schiro, Benjamin F. Hobbs and Jong-Shi Pang

Volume 65, issue 1, 2016

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings pp. 1-46 Downloads
Fu Lin, Sven Leyffer and Todd Munson
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space pp. 47-71 Downloads
Marcia Fampa, Jon Lee and Wendel Melo
Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems pp. 73-92 Downloads
Markus Leitner
On the global convergence of the inexact semi-smooth Newton method for absolute value equation pp. 93-108 Downloads
J. Y. Bello Cruz, O. P. Ferreira and L. F. Prudente
A semismooth Newton method for tensor eigenvalue complementarity problem pp. 109-126 Downloads
Zhongming Chen and Liqun Qi
New results on subgradient methods for strongly convex optimization problems with a unified analysis pp. 127-172 Downloads
Masaru Ito
Nonconvex bundle method with application to a delamination problem pp. 173-203 Downloads
Minh N. Dao, Joachim Gwinner, Dominikus Noll and Nina Ovcharova
Conjugate gradient acceleration of iteratively re-weighted least squares methods pp. 205-259 Downloads
Massimo Fornasier, Steffen Peter, Holger Rauhut and Stephan Worm
Global minima for semilinear optimal control problems pp. 261-288 Downloads
Ahmad Ahmad Ali, Klaus Deckelnick and Michael Hinze
A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems pp. 289-308 Downloads
Jiawei Chen, Qamrul Hasan Ansari, Yeong-Cheng Liou and Jen-Chih Yao

Volume 64, issue 3, 2016

Stochastic derivative-free optimization using a trust region framework pp. 619-645 Downloads
Jeffrey Larson and Stephen C. Billups
Computing the distance between the linear matrix pencil and the completely positive cone pp. 647-670 Downloads
Jinyan Fan and Anwa Zhou
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints pp. 671-697 Downloads
Jueyou Li, Guo Chen, Zhaoyang Dong and Zhiyou Wu
The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization pp. 699-724 Downloads
Ole Løseth Elvetun and Bjørn Fredrik Nielsen
Alternating direction method of multipliers for penalized zero-variance discriminant analysis pp. 725-754 Downloads
Brendan P. W. Ames and Mingyi Hong
Nonlinear residual minimization by iteratively reweighted least squares pp. 755-792 Downloads
Juliane Sigl
State-defect constraint pairing graph coarsening method for Karush–Kuhn–Tucker matrices arising in orthogonal collocation methods for optimal control pp. 793-819 Downloads
Begüm Şenses Cannataro, Anil V. Rao and Timothy A. Davis
Selective bi-coordinate variations for resource allocation type problems pp. 821-842 Downloads
Igor Konnov
Column generation approaches for the software clustering problem pp. 843-864 Downloads
Hugo Harry Kramer, Eduardo Uchoa, Marcia Fampa, Viviane Köhler and François Vanderbeck
Feature subset selection for logistic regression via mixed integer optimization pp. 865-880 Downloads
Toshiki Sato, Yuichi Takano, Ryuhei Miyashiro and Akiko Yoshise
Local convex hulls for a special class of integer multicommodity flow problems pp. 881-919 Downloads
Zhiyuan Lin and Raymond S. K. Kwan

Volume 64, issue 2, 2016

An inertia-free filter line-search algorithm for large-scale nonlinear programming pp. 327-354 Downloads
Nai-Yuan Chiang and Victor M. Zavala
Bounding duality gap for separable problems with linear constraints pp. 355-378 Downloads
Madeleine Udell and Stephen Boyd
Clustering-based preconditioning for stochastic programs pp. 379-406 Downloads
Yankai Cao, Carl D. Laird and Victor M. Zavala
Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming pp. 407-431 Downloads
Rebecca Stockbridge and Güzin Bayraksan
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems pp. 433-465 Downloads
Li-Ping Pang, Jian Lv and Jin-He Wang
Sufficient weighted complementarity problems pp. 467-488 Downloads
Florian A. Potra
On how to solve large-scale log-determinant optimization problems pp. 489-511 Downloads
Chengjing Wang
Theoretical and computational results about optimality-based domain reductions pp. 513-533 Downloads
Alberto Caprara, Marco Locatelli and Michele Monaci
A generalization of $$\omega $$ ω -subdivision ensuring convergence of the simplicial algorithm pp. 535-555 Downloads
Takahito Kuno and Tomohiro Ishihama
Distortion compensation as a shape optimisation problem for a sharp interface model pp. 557-588 Downloads
Kevin Sturm, Michael Hintermüller and Dietmar Hömberg
Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results pp. 589-618 Downloads
Günter Rudolph, Oliver Schütze, Christian Grimme, Christian Domínguez-Medina and Heike Trautmann

Volume 64, issue 1, 2016

On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation pp. 1-30 Downloads
S. Bellavia, B. Morini and E. Riccietti
An adaptive accelerated first-order method for convex optimization pp. 31-73 Downloads
Renato D. C. Monteiro, Camilo Ortiz and Benar F. Svaiter
A bundle method using two polyhedral approximations of the $$\varepsilon $$ ε -enlargement of a maximal monotone operator pp. 75-100 Downloads
Ludovic Nagesseur
A Dai–Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions pp. 101-118 Downloads
Hiroyuki Sato
Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems pp. 119-148 Downloads
Le Han, Shujun Bi and Shaohua Pan
Higher-degree eigenvalue complementarity problems for tensors pp. 149-176 Downloads
Chen Ling, Hongjin He and Liqun Qi
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs pp. 177-214 Downloads
Alexander Veremyev, Oleg A. Prokopyev, Sergiy Butenko and Eduardo L. Pasiliao
Exact solution approaches for bilevel assignment problems pp. 215-242 Downloads
Behdad Beheshti, Oleg A. Prokopyev and Eduardo L. Pasiliao
A new local dimming algorithm based on the simplex method pp. 243-263 Downloads
Martin Riplinger, Michael Krause, Alfred K. Louis and Chihao Xu
Optimization of nonlocal time-delayed feedback controllers pp. 265-294 Downloads
Peter Nestler, Eckehard Schöll and Fredi Tröltzsch
Discretization of semilinear bang-singular-bang control problems pp. 295-326 Downloads
Ursula Felgenhauer
Page updated 2017-01-21