Inexact proximal point algorithms and descent methods in optimization
DOI10.1007/S11081-005-6798-9zbMATH Open1080.90072OpenAlexW2062941769MaRDI QIDQ2575251FDOQ2575251
Authors: Carlos jun. Humes, Paulo José da Silva e Silva 
Publication date: 8 December 2005
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-005-6798-9
Recommendations
Convex programming (90C25) Nonlinear programming (90C30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cites Work
- Variational Analysis
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Convex Analysis
- A general approach to convergence properties of some methods for nonsmooth convex optimization
- Optimization. Algorithms and consistent approximations
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- Thevenin decomposition and large-scale optimization
- Some properties of generalized proximal point methods for quadratic and linear programming
- Title not available (Why is that?)
- Numerical methods for nondifferentiable convex optimization
- Strict convex regularizations, proximal points and augmented lagrangians
Cited In (16)
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Uniformity and inexact version of a proximal method for metrically regular mappings
- Descentwise inexact proximal algorithms for smooth optimization
- An accelerated inexact proximal point algorithm for convex minimization
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- An inexact proximal method for quasiconvex minimization
- The indefinite proximal point algorithms for maximal monotone operators
- A Lyusternik-Graves theorem for the proximal point method
- Self-adaptive inexact proximal point methods
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Finite convergence and sharp minima for quasi-equilibrium problems
- On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- The developments of proximal point algorithms
- An inexact proximal regularization method for unconstrained optimization
This page was built for publication: Inexact proximal point algorithms and descent methods in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575251)
