Partial Proximal Minimization Algorithms for Convex Pprogramming

DOI10.1137/0804031MaRDI QIDQ4308555zbMATH OpenOpenAlexFDO

Authors Dimitri P. Bertsekas, Paul Tseng

Publication date 8 August 1995

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0804031

zbMATH Keywords

augmented Lagrangianconvergence proofsdualityparallel algorithmsproximal minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex programming (90C25)

Recommendations

• A proximal-based deomposition method for compositions method for convex minimization problems
• A Parallel Algorithm for a Class of Convex Programs
• A parallel descent algorithm for convex programming
• Two parallel distribution algorithms for convex constrained minimization problems

Cited in

(21)

• Convergence analysis of some methods for minimizing a nonsmooth convex function
• Error bounds in mathematical programming
• Equilibrium programming using proximal-like algorithms
• Scenario decomposition of risk-averse multistage stochastic programming problems
• Some convergence results on the regularized alternating least-squares method for tensor decomposition
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• A convergent decomposition algorithm for support vector machines
• Global optimization for non-convex programs via convex proximal point method
• scientific article; zbMATH DE number 6719195 (Why is no real title available?)
• The proximal Chebychev center cutting plane algorithm for convex additive functions
• Non-Convex feasibility problems and proximal point methods
• Convergence analysis of a proximal newton method¹
• A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
• A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
• PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
• On the convergence of a modified version of SVM^lightalgorithm
• Partial proximal point method for nonmonotone equilibrium problems
• Divide to conquer: decomposition methods for energy optimization
• Fast proximity-gradient algorithms for structured convex optimization problems
• Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
• Parametric proximal-point methods

This page was built for publication: Partial Proximal Minimization Algorithms for Convex Pprogramming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308555)