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 72, issue 3, 2019

Direct search based on probabilistic feasible descent for bound and linearly constrained problems pp. 525-559

S. Gratton, C. W. Royer, L. N. Vicente and Zhaoyong Zhang

Efficient calculation of regular simplex gradients pp. 561-588

Ian Coope and Rachael Tappenden

An algorithm for binary linear chance-constrained problems using IIS pp. 589-608

Gianpiero Canessa, Julian A. Gallego, Lewis Ntaimo and Bernardo K. Pagnoncelli

Accelerating block coordinate descent methods with identification strategies pp. 609-640

R. Lopes, S. A. Santos and P. J. S. Silva

Inexact Successive quadratic approximation for regularized optimization pp. 641-674

Ching-pei Lee and Stephen J. Wright

A framework for parallel second order incremental optimization algorithms for solving partially separable problems pp. 675-705

Kamer Kaya, Figen Öztoprak, Ş. İlker Birbil, A. Taylan Cemgil, Umut Şimşekli, Nurdan Kuru, Hazal Koptagel and M. Kaan Öztürk

A random block-coordinate Douglas–Rachford splitting method with low computational complexity for binary logistic regression pp. 707-726

Luis M. Briceño-Arias, Giovanni Chierchia, Emilie Chouzenoux and Jean-Christophe Pesquet

A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme pp. 727-768

M. Paul Laiu and André L. Tits

Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions pp. 769-795

Leonid Faybusovich and Cunlu Zhou

Optimal control in first-order Sobolev spaces with inequality constraints pp. 797-826

Yu Deng, Patrick Mehlitz and Uwe Prüfert

Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce pp. 827-848

Huizhen Zhang, Cesar Beltran-Royo, Bo Wang and Ziying Zhang

Volume 72, issue 2, 2019

Cholesky QR-based retraction on the generalized Stiefel manifold pp. 293-308

Hiroyuki Sato and Kensuke Aihara

A feasible rounding approach for mixed-integer optimization problems pp. 309-337

Christoph Neumann, Oliver Stein and Nathan Sudermann-Merx

Proximal gradient methods for multiobjective optimization and their applications pp. 339-361

Hiroki Tanabe, Ellen H. Fukuda and Nobuo Yamashita

A primal-dual interior-point method based on various selections of displacement step for symmetric optimization pp. 363-390

Baha Alzalg

A simple version of bundle method with linear programming pp. 391-412

Shuai Liu

Solving optimal control problems with terminal complementarity constraints via Scholtes’ relaxation scheme pp. 413-430

Francisco Benita and Patrick Mehlitz

A partial outer convexification approach to control transmission lines pp. 431-456

S. Göttlich, A. Potschka and C. Teuber

Adaptive $$l_1$$ l 1 -regularization for short-selling control in portfolio selection pp. 457-478

Stefania Corsaro and Valentina Simone

An iterative method for solving a bi-objective constrained portfolio optimization problem pp. 479-498

Madani Bezoui, Mustapha Moulai, Ahcène Bounceur and Reinhardt Euler

A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques pp. 499-524

M. Ahmadvand, M. Esmaeilbeigi, A. Kamandi and F. M. Yaghoobi

Volume 72, issue 1, 2019

Proximal alternating penalty algorithms for nonsmooth constrained convex optimization pp. 1-43

Quoc Tran-Dinh

On monotone and primal-dual active set schemes for $$\ell ^p$$ ℓ p -type problems, $$p \in (0,1]$$ p ∈ ( 0, 1 ] pp. 45-85

Daria Ghilli and Karl Kunisch

Asynchronous parallel primal–dual block coordinate update methods for affinely constrained convex programs pp. 87-113

Yangyang Xu

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis pp. 115-157

Bo Jiang, Tianyi Lin, Shiqian Ma and Shuzhong Zhang

Newton’s method with feasible inexact projections for solving constrained generalized equations pp. 159-177

Fabiana R. Oliveira, Orizon P. Ferreira and Gilson N. Silva

Convergence of the augmented decomposition algorithm pp. 179-213

Hongsheng Liu and Shu Lu

A globally convergent Levenberg–Marquardt method for equality-constrained optimization pp. 215-239

A. F. Izmailov, M. V. Solodov and E. I. Uskov

A homogeneous model for monotone mixed horizontal linear complementarity problems pp. 241-267

Cosmin G. Petra and Florian A. Potra

On the optimal solution set in interval linear programming pp. 269-292

Elif Garajová and Milan Hladík

Volume 71, issue 3, 2018

A specialized primal-dual interior point method for the plastic truss layout optimization pp. 613-640

Alemseged Gebrehiwot Weldeyesus and Jacek Gondzio

Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case pp. 641-671

Aimé Kamgaing Kuiteing, Patrice Marcotte and Gilles Savard

A fast gradient and function sampling method for finite-max functions pp. 673-717

Elias S. Helou, Sandra A. Santos and Lucas E. A. Simões

A new reduced gradient method for solving linearly constrained multiobjective optimization problems pp. 719-741

Mustapha El Moudden and Ahmed El Ghali

On inexact ADMMs with relative error criteria pp. 743-765

Jiaxin Xie

Proximal primal–dual best approximation algorithm with memory pp. 767-794

E. M. Bednarczuk, A. Jezierska and K. E. Rutkowski

A majorization–minimization algorithm for split feasibility problems pp. 795-828

Jason Xu, Eric C. Chi, Meng Yang and Kenneth Lange

An exact and heuristic approach for the d-minimum branch vertices problem pp. 829-855

Jorge Moreno, Yuri Frota and Simone Martins

Error estimates for the approximation of multibang control problems pp. 857-878

Christian Clason, Thi Bich Tram Do and Frank Pörner

A convergence analysis of the method of codifferential descent pp. 879-913

M. V. Dolgopolik

Volume 71, issue 2, 2018

A progressive barrier derivative-free trust-region algorithm for constrained optimization pp. 307-329

Charles Audet, Andrew R. Conn, Sébastien Le Digabel and Mathilde Peyrega

Mesh-based Nelder–Mead algorithm for inequality constrained optimization pp. 331-352

Charles Audet and Christophe Tribes

A penalty method for rank minimization problems in symmetric matrices pp. 353-380

Xin Shen and John E. Mitchell

A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities pp. 381-402

Yang Zhan and Chuangyin Dang

Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach pp. 403-433

Yoshihiro Kanno

Duality of nonconvex optimization with positively homogeneous functions pp. 435-456

Shota Yamanaka and Nobuo Yamashita

Exact augmented Lagrangian functions for nonlinear semidefinite programming pp. 457-482

Ellen H. Fukuda and Bruno F. Lourenço

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier pp. 483-508

Petra Renáta Rigó and Zsolt Darvay

Finding a best approximation pair of points for two polyhedra pp. 509-523

Ron Aharoni, Yair Censor and Zilin Jiang

A two-level metaheuristic for the all colors shortest path problem pp. 525-551

F. Carrabs, R. Cerulli, R. Pentangelo and A. Raiconi

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches pp. 553-608

Guanglei Wang and Hassan Hijazi

Volume 71, issue 1, 2018

Introduction to the special issue for SIMAI 2016 pp. 1-3

Valeria Ruggiero and Gerardo Toraldo

A block coordinate variable metric linesearch based proximal gradient method pp. 5-52

S. Bonettini, M. Prato and S. Rebegoldi

A multi-objective DIRECT algorithm for ship hull optimization pp. 53-72

E. F. Campana, M. Diez, G. Liuzzi, S. Lucidi, R. Pellegrini, V. Piccialli, F. Rinaldi and A. Serani

Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming pp. 73-93

Renato De Leone, Giovanni Fasano and Yaroslav D. Sergeyev

Modified Fejér sequences and applications pp. 95-113

Junhong Lin, Lorenzo Rosasco, Silvia Villa and Ding-Xuan Zhou

Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training pp. 115-145

Andrea Manno, Laura Palagi and Simone Sagratella

Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications pp. 147-170

Leopoldo Marini, Benedetta Morini and Margherita Porcelli

Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm pp. 171-191

E. Loli Piccolomini, V. L. Coli, E. Morotti and L. Zanni

Algorithms for positive semidefinite factorization pp. 193-219

Arnaud Vandaele, François Glineur and Nicolas Gillis

A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization pp. 221-250

Norikazu Takahashi, Jiro Katayama, Masato Seki and Jun’ichi Takeuchi

An effective adaptive trust region algorithm for nonsmooth minimization pp. 251-271

Zhou Sheng and Gonglin Yuan

A non-overlapping DDM combined with the characteristic method for optimal control problems governed by convection–diffusion equations pp. 273-306

Tongjun Sun and Keying Ma