Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
From MaRDI portal
Publication:4916327
DOI10.1080/02331934.2011.592528zbMath1292.90232OpenAlexW2033203407MaRDI QIDQ4916327
Publication date: 22 April 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/133111
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Convergence of diagonally stationary sequences in convex optimization
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- Enlargement of monotone operators with applications to variational inequalities
- Coupling the proximal point algorithm with approximation methods
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- On the need for hybrid steps in hybrid proximal point methods
- Primal and dual convergence of a proximal point exponential penalty method for linear programming
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- Inexact proximal point algorithms and descent methods in optimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Path-Following Methods for Linear Programming
- Monotone Operators and the Proximal Point Algorithm
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Numerical methods for nondifferentiable convex optimization
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Viscosity Solutions of Minimization Problems
- Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
