A General Primal-Dual Envelope Method for Convex Programming Problems

DOI10.1137/S1052623497330823MaRDI QIDQ4943936zbMATH OpenOpenAlexFDO

Authors

Publication date 19 March 2000

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

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

zbMATH Keywords

convex programminglarge-scale decompositionprimal-dual methods

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Applications of the method of partial inverses to convex programming: Decomposition
• scientific article; zbMATH DE number 3959124
• scientific article; zbMATH DE number 6027005
• A parallel descent algorithm for convex programming
• Two general methods for computing saddle points with applications for decomposing convex programming problems

Cited in

(3)

• Using convex envelopes to solve the interactive fixed-charge linear programming problem
• An algorithm for decomposition coordination of large scale convex programming problems
• Large-scale optimization with the primal-dual column generation method

This page was built for publication: A General Primal-Dual Envelope Method for Convex Programming Problems

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