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 68, issue 3, 2017

Using negative curvature in solving nonlinear programs pp. 479-502

Donald Goldfarb, Cun Mu, John Wright and Chaoxu Zhou

A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming pp. 503-532

Chengjing Wang and Peipei Tang

On the use of the energy norm in trust-region and adaptive cubic regularization subproblems pp. 533-554

E. Bergou, Y. Diouane and S. Gratton

On the worst-case evaluation complexity of non-monotone line search algorithms pp. 555-577

Geovani N. Grapiglia and Ekkehard W. Sachs

Inexact proximal stochastic gradient method for convex composite optimization pp. 579-618

Xiao Wang, Shuxiong Wang and Hongchao Zhang

$$\ell _p$$ ℓ p Regularized low-rank approximation via iterative reweighted singular value minimization pp. 619-642

Zhaosong Lu, Yong Zhang and Jian Lu

Shrinking gradient descent algorithms for total variation regularized image denoising pp. 643-660

Mingqiang Li, Congying Han, Ruxin Wang and Tiande Guo

An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions pp. 661-669

André Berger, Alexander Grigoriev and Andrej Winokurow

MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys pp. 671-687

Peter A. Graf and Stephen Billups

Algorithms for generalized potential games with mixed-integer variables pp. 689-717

Simone Sagratella

Markov–Dubins path via optimal control theory pp. 719-747

C. Yalçın Kaya

Decomposition methods based on articulation vertices for degree-dependent spanning tree problems pp. 749-773

Mercedes Landete, Alfredo Marín and José Luis Sainz-Pardo

Variable neighborhood scatter search for the incremental graph drawing problem pp. 775-797

Jesús Sánchez-Oro, Anna Martínez-Gavara, Manuel Laguna, Rafael Martí and Abraham Duarte

Volume 68, issue 2, 2017

An exact algorithm for a resource allocation problem in mobile wireless communications pp. 193-208

Adam N. Letchford, Qiang Ni and Zhaoyu Zhong

An interior-point implementation developed and tuned for radiation therapy treatment planning pp. 209-242

Sebastiaan Breedveld, Bas Berg and Ben Heijmen

On the control of time discretized dynamic contact problems pp. 243-287

Georg Müller and Anton Schiela

Mitigating the curse of dimensionality: sparse grid characteristics method for optimal feedback control and HJB equations pp. 289-315

Wei Kang and Lucas C. Wilcox

Descent algorithm for nonsmooth stochastic multiobjective optimization pp. 317-331

Fabrice Poirion, Quentin Mercier and Jean-Antoine Désidéri

An alternating direction and projection algorithm for structure-enforced matrix factorization pp. 333-362

Lijun Xu, Bo Yu and Yin Zhang

Approximate ADMM algorithms derived from Lagrangian splitting pp. 363-405

Jonathan Eckstein and Wang Yao

Peaceman–Rachford splitting for a class of nonconvex optimization problems pp. 407-436

Guoyin Li, Tianxiang Liu and Ting Kei Pong

A generalized elastic net regularization with smoothed $$\ell _{q}$$ ℓ q penalty for sparse vector recovery pp. 437-454

Yong Zhang, Wanzhou Ye and Jianjun Zhang

On the convergence of alternating minimization methods in variational PGD pp. 455-472

A. El Hamidi, H. Ossman and M. Jazar

Volume 68, issue 1, 2017

A comparison of reduced and unreduced KKT systems arising from interior point methods pp. 1-27

Benedetta Morini, Valeria Simoncini and Mattia Tani

Two wide neighborhood interior-point methods for symmetric cone optimization pp. 29-55

M. Sayadi Shahraki, H. Mansouri and M. Zangiabadi

Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators pp. 57-93

Puya Latafat and Panagiotis Patrinos

A new method for interpolating in a convex subset of a Hilbert space pp. 95-120

Xavier Bay, Laurence Grammont and Hassan Maatouk

Reliable a posteriori error estimation for state-constrained optimal control pp. 121-162

A. Rösch, K. G. Siebert and S. Steinig

On the resolution of certain discrete univariate max–min problems pp. 163-192

Ramsharan Rangarajan

Volume 67, issue 3, 2017

Forward–backward quasi-Newton methods for nonsmooth optimization problems pp. 443-487

Lorenzo Stella, Andreas Themelis and Panagiotis Patrinos

Further properties of the forward–backward envelope with applications to difference-of-convex programming pp. 489-520

Tianxiang Liu and Ting Kei Pong

Total variation image deblurring with space-varying kernel pp. 521-541

Daniel O’Connor and Lieven Vandenberghe

$$S_{1/2}$$ S 1 / 2 regularization methods and fixed point algorithms for affine rank minimization problems pp. 543-569

Dingtao Peng, Naihua Xiu and Jian Yu

New subgradient extragradient methods for common solutions to equilibrium problems pp. 571-594

Dang Hieu

Generalized Krasnoselskii–Mann-type iterations for nonexpansive mappings in Hilbert spaces pp. 595-620

Christian Kanzow and Yekini Shehu

Volume 67, issue 2, 2017

Second-order orthant-based methods with enriched Hessian information for sparse $$\ell _1$$ ℓ 1 -optimization pp. 225-258

J. C. De Los Reyes, E. Loayza and P. Merino

Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions pp. 259-292

Patrick R. Johnstone and Pierre Moulin

Branch-and-price for p-cluster editing pp. 293-316

Teobaldo Bulhões, Anand Subramanian, Gilberto F. Sousa Filho and Lucídio dos Anjos F. Cabral

Solving nearly-separable quadratic optimization problems as nonsmooth equations pp. 317-360

Frank E. Curtis and Arvind U. Raghunathan

An SQP method for mathematical programs with vanishing constraints with strong convergence properties pp. 361-399

Matúš Benko and Helmut Gfrerer

$$L^1$$ L 1 penalization of volumetric dose objectives in optimal control of PDEs pp. 401-419

Richard C. Barnard and Christian Clason

Visualization of the $$\varepsilon $$ ε -subdifferential of piecewise linear–quadratic functions pp. 421-442

Anuj Bajaj, Warren Hare and Yves Lucet

Volume 67, issue 1, 2017

A dual gradient-projection method for large-scale strictly convex quadratic problems pp. 1-38

Nicholas I. M. Gould and Daniel P. Robinson

Error estimates for integral constraint regularization of state-constrained elliptic control problems pp. 39-71

B. Jadamba, A. Khan and M. Sama

A Riemannian conjugate gradient method for optimization on the Stiefel manifold pp. 73-110

Xiaojing Zhu

A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods pp. 111-127

Porfirio Suñagua and Aurelio R. L. Oliveira

Subspace-stabilized sequential quadratic programming pp. 129-154

A. F. Izmailov and E. I. Uskov

On merit functions for p-order cone complementarity problem pp. 155-173

Xin-He Miao, Yu-Lin Chang and Jein-Shan Chen

Analysis on Newton projection method for the split feasibility problem pp. 175-199

Biao Qu, Changyu Wang and Naihua Xiu

Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks pp. 201-223

Filippo Pecci, Edo Abraham and Ivan Stoianov