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 77, issue 3, 2020
- Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton’s equation pp. 627-651

- Andrea Caliciotti, Giovanni Fasano, Florian Potra and Massimo Roma
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods pp. 653-710

- Nicolas Loizou and Peter Richtárik
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem pp. 711-728

- Masao Fukushima, Joaquim Júdice, Welington Oliveira and Valentina Sessa
- Convergence rates for an inexact ADMM applied to separable convex optimization pp. 729-754

- William W. Hager and Hongchao Zhang
- A proximal-point outer approximation algorithm pp. 755-777

- Massimo De Mauri, Joris Gillis, Jan Swevers and Goele Pipeleers
- Riemannian conjugate gradient methods with inverse retraction pp. 779-810

- Xiaojing Zhu and Hiroyuki Sato
- Hybrid Riemannian conjugate gradient methods with global convergence properties pp. 811-830

- Hiroyuki Sakai and Hideaki Iiduka
- A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems pp. 831-869

- Veronika Karl, Ira Neitzel and Daniel Wachsmuth
- Expected residual minimization method for monotone stochastic tensor complementarity problem pp. 871-896

- Zhenyu Ming, Liping Zhang and Liqun Qi
- On the use of polynomial models in multiobjective directional direct search pp. 897-918

- C. P. Brás and A. L. Custódio
Volume 77, issue 2, 2020
- An explicit Tikhonov algorithm for nested variational inequalities pp. 335-350

- Lorenzo Lampariello, Christoph Neumann, Jacopo M. Ricci, Simone Sagratella and Oliver Stein
- On the interplay between acceleration and identification for the proximal gradient algorithm pp. 351-378

- Gilles Bareilles and Franck Iutzeler
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions pp. 379-409

- M. Maleknia and M. Shamsi
- Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization pp. 411-432

- Yunmei Chen, Xiaojing Ye and Wei Zhang
- A variation of Broyden class methods using Householder adaptive transforms pp. 433-463

- S. Cipolla, C. Di Fiore and P. Zellini
- The distance between convex sets with Minkowski sum structure: application to collision detection pp. 465-490

- Xiangfeng Wang, Junping Zhang and Wenxing Zhang
- Weak convergence of iterative methods for solving quasimonotone variational inequalities pp. 491-508

- Hongwei Liu and Jun Yang
- On a numerical shape optimization approach for a class of free boundary problems pp. 509-537

- A. Boulkhemair, A. Chakib, A. Nachaoui, A. A. Niftiyev and A. Sadik
- Oracle-based algorithms for binary two-stage robust optimization pp. 539-569

- Nicolas Kämmerling and Jannis Kurtz
- Global optimization via inverse distance weighting and radial basis functions pp. 571-595

- Alberto Bemporad
- Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation pp. 597-616

- Siamak Akbarzadeh, Jan Hückelheim and Jens-Dominik Müller
Volume 77, issue 1, 2020
- On the convergence of steepest descent methods for multiobjective optimization pp. 1-27

- G. Cocchi, G. Liuzzi, S. Lucidi and M. Sciandrone
- An augmented Lagrangian algorithm for multi-objective optimization pp. 29-56

- G. Cocchi and M. Lapucci
- An active-set algorithmic framework for non-convex optimization problems over the simplex pp. 57-89

- Andrea Cristofari, Marianna Santis, Stefano Lucidi and Francesco Rinaldi
- Convergence study of indefinite proximal ADMM with a relaxation factor pp. 91-123

- Min Tao
- On the resolution of misspecified convex optimization and monotone variational inequality problems pp. 125-161

- Hesam Ahmadi and Uday V. Shanbhag
- Make $$\ell _1$$ ℓ 1 regularization effective in training sparse CNN pp. 163-182

- Juncai He, Xiaodong Jia, Jinchao Xu, Lian Zhang and Liang Zhao
- Convergence rates of subgradient methods for quasi-convex optimization problems pp. 183-212

- Yaohua Hu, Jiawen Li and Carisa Kwok Wai Yu
- Inverse point source location with the Helmholtz equation on a bounded domain pp. 213-249

- Konstantin Pieper, Bao Quoc Tang, Philip Trautmann and Daniel Walter
- A second-order shape optimization algorithm for solving the exterior Bernoulli free boundary problem using a new boundary cost functional pp. 251-305

- Julius Fergy T. Rabago and Hideyuki Azegami
- Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis pp. 307-334

- Nicolas Delanoue, Mehdi Lhommeau and Sébastien Lagrange
Volume 76, issue 3, 2020
- Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization pp. 615-619

- Ernesto G. Birgin
- An inexact proximal generalized alternating direction method of multipliers pp. 621-647

- V. A. Adona, M. L. N. Gonçalves and J. G. Melo
- A modified proximal point method for DC functions on Hadamard manifolds pp. 649-673

- Yldenilson Torres Almeida, João Xavier Cruz Neto, Paulo Roberto Oliveira and João Carlos de Oliveira Souza
- The block-wise circumcentered–reflection method pp. 675-699

- Roger Behling, J.-Yunier Bello-Cruz and Luiz-Rafael Santos
- Inexact restoration with subsampled trust-region methods for finite-sum minimization pp. 701-736

- Stefania Bellavia, Nataša Krejić and Benedetta Morini
- An Augmented Lagrangian method for quasi-equilibrium problems pp. 737-766

- L. F. Bueno, G. Haeser, F. Lara and F. N. Rojas
- Towards an efficient augmented Lagrangian method for convex quadratic programming pp. 767-800

- Luís Felipe Bueno, Gabriel Haeser and Luiz-Rafael Santos
- A penalty-free method with superlinear convergence for equality constrained optimization pp. 801-833

- Zhongwen Chen, Yu-Hong Dai and Jiangyan Liu
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification pp. 835-866

- M. A. Diniz-Ehrhardt, D. G. Ferreira and S. A. Santos
- Non-monotone inexact restoration method for nonlinear programming pp. 867-888

- Juliano B. Francisco, Douglas S. Gonçalves, Fermín S. V. Bazán and Lila L. T. Paredes
- On the extension of the Hager–Zhang conjugate gradient method for vector optimization pp. 889-916

- M. L. N. Gonçalves and L. F. Prudente
- A note on solving nonlinear optimization problems in variable precision pp. 917-933

- S. Gratton and Ph. L. Toint
- A class of Benders decomposition methods for variational inequalities pp. 935-959

- Juan Pablo Luna, Claudia Sagastizábal and Mikhail Solodov
- A regularization method for constrained nonlinear least squares pp. 961-989

- Dominique Orban and Abel Soares Siqueira
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems pp. 991-1019

- Mauricio Romero Sicre
Volume 76, issue 2, 2020
- Numerically tractable optimistic bilevel problems pp. 277-303

- Lorenzo Lampariello and Simone Sagratella
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems pp. 305-346

- Weiwei Kong, Jefferson G. Melo and Renato D. C. Monteiro
- Accelerating incremental gradient optimization with curvature information pp. 347-380

- Hoi-To Wai, Wei Shi, César A. Uribe, Angelia Nedić and Anna Scaglione
- Inexact first-order primal–dual algorithms pp. 381-430

- Julian Rasch and Antonin Chambolle
- Quantitative analysis for a class of two-stage stochastic linear variational inequality problems pp. 431-460

- Jie Jiang, Xiaojun Chen and Zhiping Chen
- Algorithms for stochastic optimization with function or expectation constraints pp. 461-498

- Guanghui Lan and Zhiqiang Zhou
- The Pontryagin maximum principle for solving Fokker–Planck optimal control problems pp. 499-533

- Tim Breitenbach and Alfio Borzì
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints pp. 535-569

- Si-Tong Lu, Miao Zhang and Qing-Na Li
- A differentiable path-following algorithm for computing perfect stationary points pp. 571-588

- Yang Zhan, Peixuan Li and Chuangyin Dang
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function pp. 589-614

- Kevin C. Furman, Nicolas W. Sawaya and Ignacio E. Grossmann
Volume 76, issue 1, 2020
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging pp. 1-31

- Pooriya Beyhaghi, Ryan Alimo and Thomas Bewley
- A dual spectral projected gradient method for log-determinant semidefinite problems pp. 33-68

- Takashi Nakagaki, Mituhiro Fukuda, Sunyoung Kim and Makoto Yamashita
- Composite convex optimization with global and local inexact oracles pp. 69-124

- Tianxiao Sun, Ion Necoara and Quoc Tran-Dinh
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods pp. 125-153

- Li-Ping Pang, Qi Wu, Jin-He Wang and Qiong Wu
- Error estimates for the finite element approximation of bilinear boundary control problems pp. 155-199

- Max Winkler
- Efficient local search procedures for quadratic fractional programming problems pp. 201-232

- Luca Consolini, Marco Locatelli, Jiulin Wang and Yong Xia
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems pp. 233-275

- Patrick Mehlitz
| |