# Computational Optimization and Applications
2016 - 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 2, 2017**
- Local nonglobal minima for solving large-scale extended trust-region subproblems pp. 223-244
*Maziar Salahi*, *Akram Taati* and *Henry Wolkowicz*
- On solving L-SR1 trust-region subproblems pp. 245-266
*Johannes Brust*, *Jennifer B. Erway* and *Roummel F. Marcia*
- A semidefinite algorithm for completely positive tensor decomposition pp. 267-283
*Jinyan Fan* and *Anwa Zhou*
- Computing the generalized eigenvalues of weakly symmetric tensors pp. 285-307
*Na Zhao*, *Qingzhi Yang* and *Yajun Liu*
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints pp. 309-326
*Meijiao Liu* and *Yong-Jin Liu*
- A note on the convergence of ADMM for linearly constrained convex optimization problems pp. 327-343
*Liang Chen*, *Defeng Sun* and *Kim-Chuan Toh*
- Decomposable norm minimization with proximal-gradient homotopy algorithm pp. 345-381
*Reza Eghbali* and *Maryam Fazel*
- Modeling max–min fair bandwidth allocation in BitTorrent communities pp. 383-400
*Elvira Antal* and *Tamás Vinkó*
**Volume 66, issue 1, 2017**
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study pp. 1-37
*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
*Xingju Cai*, *Deren Han* and *Xiaoming Yuan*
- Modified hybrid projection methods for finding common solutions to variational inequality problems pp. 75-96
*Dang Hieu*, *Pham Ky Anh* and *Le Dung Muu*
- Conic approximation to quadratic optimization with linear complementarity constraints pp. 97-122
*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
*Sergio González-Andrade*
- Simple decentralized graph coloring pp. 163-185
*Severino F. Galán*
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation pp. 187-218
*Chao Ding* and *Hou-Duo Qi*
- Erratum to: A regularized Newton method without line search for unconstrained optimization pp. 219-222
*Kenji Ueda* and *Nobuo Yamashita*
**Volume 65, issue 3, 2016**
- On handling indicator constraints in mixed integer programming pp. 545-566
*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
*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
*Kimon Fountoulakis* and *Jacek Gondzio*
- Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support pp. 637-669
*W. Ackooij*, *A. Frangioni* and *W. Oliveira*
- Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization pp. 671-698
*Yakui Huang* and *Hongwei Liu*
- Sequential equality-constrained optimization for nonlinear programming pp. 699-721
*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
*Elizabeth W. Karas*, *Sandra A. Santos* and *Benar F. Svaiter*
- A modified Levenberg–Marquardt method with line search for nonlinear equations pp. 753-779
*Liang Chen*
- An adaptive gradient method for computing generalized tensor eigenpairs pp. 781-797
*Gaohang Yu*, *Zefeng Yu*, *Yi Xu*, *Yisheng Song* and *Yi Zhou*
- Spherical optimization with complex variablesfor computing US-eigenpairs pp. 799-820
*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
*Rafael A. Melo*, *Phillippe Samer* and *Sebastián Urrutia*
- Building an iterative heuristic solver for a quantum annealer pp. 845-869
*Gili Rosenberg*, *Mohammad Vazifeh*, *Brad Woods* and *Eldad Haber*
**Volume 65, issue 2, 2016**
- Guest editorial pp. 309-311
*Gianni Di Pillo* and *Massimo Roma*
- Central axes and peripheral points in high dimensional directional datasets pp. 313-338
*Annabella Astorino*, *Manlio Gaudioso* and *Alberto Seeger*
- On the update of constraint preconditioners for regularized KKT systems pp. 339-360
*Stefania Bellavia*, *Valentina De Simone*, *Daniela di Serafino* and *Benedetta Morini*
- A DIRECT-type approach for derivative-free constrained global optimization pp. 361-397
*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
*Giovanni Fasano* and *Massimo Roma*
- Improved error bound and a hybrid method for generalized Nash equilibrium problems pp. 431-448
*Axel Dreves*
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization pp. 449-475
*G. Liuzzi*, *S. Lucidi* and *V. Piccialli*
- Solving uniform coverage problem with a modified Remez-algorithm pp. 477-491
*D. Nowak* and *K. H. Küfer*
- Reduction of affine variational inequalities pp. 493-509
*Stephen M. Robinson*
- Perfectly competitive capacity expansion games with risk-averse participants pp. 511-539
*Dane A. Schiro*, *Benjamin F. Hobbs* and *Jong-Shi Pang*
**Volume 65, issue 1, 2016**
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space pp. 47-71
*Marcia Fampa*, *Jon Lee* and *Wendel Melo*
- Nonconvex bundle method with application to a delamination problem pp. 173-203
*Minh N. Dao*, *Joachim Gwinner*, *Dominikus Noll* and *Nina Ovcharova*
- Global minima for semilinear optimal control problems pp. 261-288
*Ahmad Ahmad Ali*, *Klaus Deckelnick* and *Michael Hinze*
**Volume 64, issue 3, 2016**
- Computing the distance between the linear matrix pencil and the completely positive cone pp. 647-670
*Jinyan Fan* and *Anwa Zhou*
- The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization pp. 699-724
*Ole Løseth Elvetun* and *Bjørn Fredrik Nielsen*
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis pp. 725-754
*Brendan P. W. Ames* and *Mingyi Hong*
- Nonlinear residual minimization by iteratively reweighted least squares pp. 755-792
*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
*Begüm Şenses Cannataro*, *Anil V. Rao* and *Timothy A. Davis*
- Selective bi-coordinate variations for resource allocation type problems pp. 821-842
*Igor Konnov*
- Column generation approaches for the software clustering problem pp. 843-864
*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
*Toshiki Sato*, *Yuichi Takano*, *Ryuhei Miyashiro* and *Akiko Yoshise*
- Local convex hulls for a special class of integer multicommodity flow problems pp. 881-919
*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
*Nai-Yuan Chiang* and *Victor M. Zavala*
- Bounding duality gap for separable problems with linear constraints pp. 355-378
*Madeleine Udell* and *Stephen Boyd*
- Clustering-based preconditioning for stochastic programs pp. 379-406
*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
*Rebecca Stockbridge* and *Güzin Bayraksan*
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems pp. 433-465
*Li-Ping Pang*, *Jian Lv* and *Jin-He Wang*
- Sufficient weighted complementarity problems pp. 467-488
*Florian A. Potra*
- On how to solve large-scale log-determinant optimization problems pp. 489-511
*Chengjing Wang*
- Theoretical and computational results about optimality-based domain reductions pp. 513-533
*Alberto Caprara*, *Marco Locatelli* and *Michele Monaci*
- A generalization of $$\omega $$ ω -subdivision ensuring convergence of the simplicial algorithm pp. 535-555
*Takahito Kuno* and *Tomohiro Ishihama*
- Distortion compensation as a shape optimisation problem for a sharp interface model pp. 557-588
*Kevin Sturm*, *Michael Hintermüller* and *Dietmar Hömberg*
- Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results pp. 589-618
*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
*S. Bellavia*, *B. Morini* and *E. Riccietti*
- An adaptive accelerated first-order method for convex optimization pp. 31-73
*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
*Ludovic Nagesseur*
- A Dai–Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions pp. 101-118
*Hiroyuki Sato*
- Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems pp. 119-148
*Le Han*, *Shujun Bi* and *Shaohua Pan*
- Higher-degree eigenvalue complementarity problems for tensors pp. 149-176
*Chen Ling*, *Hongjin He* and *Liqun Qi*
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs pp. 177-214
*Alexander Veremyev*, *Oleg A. Prokopyev*, *Sergiy Butenko* and *Eduardo L. Pasiliao*
- Exact solution approaches for bilevel assignment problems pp. 215-242
*Behdad Beheshti*, *Oleg A. Prokopyev* and *Eduardo L. Pasiliao*
- A new local dimming algorithm based on the simplex method pp. 243-263
*Martin Riplinger*, *Michael Krause*, *Alfred K. Louis* and *Chihao Xu*
- Optimization of nonlocal time-delayed feedback controllers pp. 265-294
*Peter Nestler*, *Eckehard Schöll* and *Fredi Tröltzsch*
- Discretization of semilinear bang-singular-bang control problems pp. 295-326
*Ursula Felgenhauer*
| |