Proximal methods for nonlinear programming: Double regularization and inexact subproblems
From MaRDI portal
Publication:975360
DOI10.1007/s10589-009-9274-1zbMath1220.90164OpenAlexW2090589861MaRDI QIDQ975360
Jonathan Eckstein, Paulo J. S. Silva
Publication date: 9 June 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9274-1
Related Items
A practical relative error criterion for augmented Lagrangians, Alternating forward-backward splitting for linearly constrained optimization problems, Interior proximal method without the cutting plane property, A general self-adaptive relaxed-PPA method for convex programming with linear constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some inexact hybrid proximal augmented Lagrangian algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Proximal minimization algorithm with \(D\)-functions
- A practical general approximation criterion for methods of multipliers based on Bregman distances
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A nonsmooth version of Newton's method
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Double-regularization proximal methods, with complementarity applications
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
- Nonsmooth Equations: Motivation and Algorithms
- A New Active Set Algorithm for Box Constrained Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Rate of Convergence of Several Conjugate Gradient Algorithms
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convex Analysis
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Benchmarking optimization software with performance profiles.
