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 73, issue 3, 2019
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization pp. 707-753

- E. G. Birgin and J. M. Martínez
- Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces pp. 755-790

- Eike Börgens and Christian Kanzow
- Robust optimal discrete arc sizing for tree-shaped potential networks pp. 791-819

- Martin Robinius, Lars Schewe, Martin Schmidt, Detlef Stolten, Johannes Thürauf and Lara Welder
- An algorithm for equilibrium selection in generalized Nash equilibrium problems pp. 821-837

- Axel Dreves
- A parameterized Douglas–Rachford algorithm pp. 839-869

- Dongying Wang and Xianfu Wang
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective pp. 871-901

- Feng Ma
- A simple convergence analysis of Bregman proximal gradient algorithm pp. 903-912

- Yi Zhou, Yingbin Liang and Lixin Shen
- Modified extragradient-like algorithms with new stepsizes for variational inequalities pp. 913-932

- Dang Hieu, Pham Ky Anh and Le Dung Muu
- The Uzawa-MBB type algorithm for nonsymmetric saddle point problems pp. 933-956

- Zhitao Xu and Li Gao
- Convergence of a stabilized SQP method for equality constrained optimization pp. 957-996

- Songqiang Qiu
- Maximum–norm a posteriori error estimates for an optimal control problem pp. 997-1017

- Enrique Otárola, Richard Rankin and Abner J. Salgado
- Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications pp. 1019-1019

- Zhi Wang, K. Droegemeier and L. White
Volume 73, issue 2, 2019
- Iteratively reweighted $$\ell _1$$ ℓ 1 algorithms with extrapolation pp. 353-386

- Peiran Yu and Ting Kei Pong
- Empirical risk minimization: probabilistic complexity and stepsize strategy pp. 387-410

- Chin Pang Ho and Panos Parpas
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems pp. 411-452

- Andrea Cristofari
- A singular value p-shrinkage thresholding algorithm for low rank matrix recovery pp. 453-476

- Yu-Fan Li, Kun Shang and Zheng-Hai Huang
- A semismooth Newton method for support vector classification and regression pp. 477-508

- Juan Yin and Qingna Li
- A sub-additive DC approach to the complementarity problem pp. 509-534

- L. Abdallah, M. Haddou and T. Migot
- Optimized choice of parameters in interior-point methods for linear programming pp. 535-574

- Luiz-Rafael Santos, Fernando Villas-Bôas, Aurelio R. L. Oliveira and Clovis Perin
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs pp. 575-601

- Lluís-Miquel Munguía, Geoffrey Oxberry, Deepak Rajan and Yuji Shinano
- Ordered p-median problems with neighbourhoods pp. 603-645

- Víctor Blanco
- Markov–Dubins interpolating curves pp. 647-677

- C. Yalçın Kaya
- Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design pp. 679-705

- Jean-Thomas Camino, Christian Artigues, Laurent Houssin and Stéphane Mourgues
Volume 73, issue 1, 2019
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems pp. 1-35

- Nicholas I. M. Gould, Tyrone Rees and Jennifer A. Scott
- A new approximation hierarchy for polynomial conic optimization pp. 37-67

- Peter J. C. Dickinson and Janez Povh
- A refined convergence analysis of $$\hbox {pDCA}_{e}$$ pDCA e with applications to simultaneous sparse recovery and outlier detection pp. 69-100

- Tianxiang Liu, Ting Kei Pong and Akiko Takeda
- Graph-based algorithms for the efficient solution of optimization problems involving monotone functions pp. 101-128

- Luca Consolini, Mattia Laurini and Marco Locatelli
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems pp. 129-158

- Zhongming Wu and Min Li
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization pp. 159-199

- Yunmei Chen, Guanghui Lan, Yuyuan Ouyang and Wei Zhang
- Inexact alternating direction methods of multipliers for separable convex optimization pp. 201-235

- William W. Hager and Hongchao Zhang
- Projective method of multipliers for linearly constrained convex minimization pp. 237-273

- Majela Pentón Machado
- A strong Lagrangian relaxation for general discrete-choice network revenue management pp. 275-310

- Sumit Kunnumkal and Kalyan Talluri
- PAL-Hom method for QP and an application to LP pp. 311-352

- Guoqiang Wang and Bo Yu
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
| |