A Decomposition Method and Its Application to Convex Programming

DOI10.1287/MOOR.14.2.237MaRDI QIDQ3824112zbMATH OpenOpenAlexFDO

Authors Shih-Ping Han

Publication date 1989

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.14.2.237

zbMATH Keywords

convergence analysisproximal pointquadratic functionsum of proper closed convex functions

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Convex programming (90C25)

Recommendations

• Decomposition method of descent for minimizing the sum of convex nonsmooth functions
• A method for minimizing the sum of a convex function and a continuously differentiable function
• Two methods for minimizing convex functions in a class of nonconvex sets
• Proximal Decomposition Via Alternating Linearization
• Nonlinear proximal decomposition method for convex programming

Cited in

(34)

• A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
• Decomposition algorithm for convex differentiable minimization
• Decomposition methods: A new proof of convergence
• A proximal-based deomposition method for compositions method for convex minimization problems
• On the structure of convex piecewise quadratic functions
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
• A parallel descent algorithm for convex programming
• Convex programming for disjunctive convex optimization
• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities
• Dual coordinate ascent methods for non-strictly convex minimization
• A decomposition based algorithm for maximal contractions
• scientific article; zbMATH DE number 6387439 (Why is no real title available?)
• scientific article; zbMATH DE number 5846648 (Why is no real title available?)
• scientific article; zbMATH DE number 411827 (Why is no real title available?)
• scientific article; zbMATH DE number 4203607 (Why is no real title available?)
• Decomposition-aggregation method for convex programming problems
• scientific article; zbMATH DE number 3916053 (Why is no real title available?)
• A regularized decomposition method for minimizing a sum of polyhedral functions
• scientific article; zbMATH DE number 4031405 (Why is no real title available?)
• scientific article; zbMATH DE number 4033519 (Why is no real title available?)
• scientific article; zbMATH DE number 1375371 (Why is no real title available?)
• scientific article; zbMATH DE number 124637 (Why is no real title available?)
• A decomposition method for quadratic programming
• scientific article; zbMATH DE number 7289916 (Why is no real title available?)
• Linear decomposition approach for a class of nonconvex programming problems
• scientific article; zbMATH DE number 5169224 (Why is no real title available?)
• scientific article; zbMATH DE number 6027005 (Why is no real title available?)
• ANALYSIS OF THE STRONG INSTANCE FOR THE VECTOR DECOMPOSITION PROBLEM
• A graph-based decomposition method for convex quadratic optimization with indicators
• Numerical behavior of LP algorithms based upon the decomposition principle
• Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
• Numerical decomposition of a convex function
• An approximate decomposition algorithm for convex minimization

This page was built for publication: A Decomposition Method and Its Application to Convex Programming

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