default search action
Computational Optimization and Applications, Volume 87
Volume 87, Number 1, January 2024
- Bastian Pötzl
, Anton Schiela, Patrick Jaap
Inexact proximal Newton methods in Hilbert spaces. 1-37 - Shiwei Wang
Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming. 39-81 - Roger Behling
A successive centralized circumcentered-reflection method for the convex feasibility problem. 83-116 - Zichong Li, Pin-Yu Chen, Sijia Liu, Songtao Lu, Yangyang Xu
Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization. 117-147 - A. Mohammadi
A trust-region approach for computing Pareto fronts in multiobjective optimization. 149-179 - Quoc Tran-Dinh
From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems. 181-218 - R. Tyrrell Rockafellar
Generalizations of the proximal method of multipliers in convex optimization. 219-247 - Shengchao Zhao, Yongchao Liu
Distributed stochastic compositional optimization problems over directed networks. 249-288 - Jianghua Yin, Jinbao Jian
A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations. 289-322 - Javier Peña
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems. 323-335
Volume 87, Number 2, March 2024
- Shahabeddin Najafi
Multiobjective BFGS method for optimization on Riemannian manifolds. 337-354 - Shuotao Diao, Suvrajeet Sen
Distribution-free algorithms for predictive stochastic programming in the presence of streaming data. 355-395 - Patrick R. Johnstone, Jonathan Eckstein
Stochastic projective splitting. 397-437 - Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn, Shinjae Yoo:
Correction to: Stochastic projective splitting. 439 - Yassine Nabou
Efficiency of higher-order algorithms for minimizing composite functions. 441-473 - Marco Locatelli
A new technique to derive tight convex underestimators (sometimes envelopes). 475-499 - Felipe Fidalgo
A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems. 501-530 - Mikhail A. Karapetyants:
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique. 531-569 - Ensio Suonperä
Linearly convergent bilevel optimization with single-step inner methods. 571-610 - Shummin Nakayama
Inexact proximal DC Newton-type method for nonconvex composite functions. 611-640 - Stuart M. Harwood
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming. 641-676 - Annalisa Greco
A nested genetic algorithm strategy for an optimal seismic design of frames. 677-704 - Claire Boyer, Antoine Godichon-Baggioni
Correction: On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions. 705-706
Volume 87, Number 3, April 2024
- Christian Clason:
Preface to special issue on "optimal control of nonlinear differential equations". 707-710 - Elisabeth Diehl, Johannes Haubner, Michael Ulbrich
Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension. 711-751 - Elisabeth Diehl, Johannes Haubner, Michael Ulbrich, Stefan Ulbrich:
Correction to: Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension. 753-754 - Fabian Hoppe
A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE. 755-784 - Sudeep Kundu
Policy iteration for Hamilton-Jacobi-Bellman equations with control constraints. 785-809 - Daniel Wachsmuth
Optimal control problems with L0(Ømega ) constraints: maximum principle and proximal gradient method. 811-833 - Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I. 835-891 - Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II. 893-934 - Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein
The continuous stochastic gradient method: part I-convergence theory. 935-976 - Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein
The continuous stochastic gradient method: part II-application and numerics. 977-1008 - Max Grieshammer, Lukas Pflug, Michael Stingl, Andrian Uihlein
Correction to: The continuous stochastic gradient method: part II-application and numerics. 1009-1010 - Shiru Li, Tao Zhang, Yong Xia
A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares. 1011-1031 - Can Li, Yannan Chen
Internet traffic tensor completion with tensor nuclear norm. 1033-1057 - Robert M. Gower
A Bregman-Kaczmarz method for nonlinear systems of equations. 1059-1098
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-28 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: