Generalized proximal point algorithm for convex optimization

DOI10.1007/BF02192181zbMath0845.90100OpenAlexW2090979728MaRDI QIDQ1908641

Yanyan Li

Publication date: 16 September 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192181

zbMATH Keywords

generalized proximal point algorithmblock-angular linear and quadratic programming problems

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05)

Related Items (2)

Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ Partial proximal point method for nonmonotone equilibrium problems

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel bundle-based decomposition for large-scale structured mathematical programming problems
• Implementing proximal point methods for linear programming
• DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
• Decomposition Principle for Linear Programs
• A Generalization of the Proximal Point Algorithm
• Computational experience with advanced implementation of decomposition algorithms for linear programming
• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Numerical methods for nondifferentiable convex optimization
• Convex Analysis

This page was built for publication: Generalized proximal point algorithm for convex optimization