Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations
From MaRDI portal
Publication:5231367
DOI10.1080/02331934.2019.1597357zbMath1419.90086arXiv1602.06794OpenAlexW2963730749WikidataQ128152620 ScholiaQ128152620MaRDI QIDQ5231367
No author found.
Publication date: 26 August 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.06794
Convex programming (90C25) Nonlinear programming (90C30) Monotone operators and generalizations (47H05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Comments on ``The proximal point algorithm revisited
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
- Monotone (nonlinear) operators in Hilbert space
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- The proximal point algorithm revisited
- Cubic regularization of Newton method and its global performance
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities
- Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
- A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- On the Subdifferentiability of Convex Functions
This page was built for publication: Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations