A Decomposition Method and Its Application to Convex Programming

From MaRDI portal

Revision as of 15:42, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3824112

Jump to:navigation, search

DOI10.1287/MOOR.14.2.237zbMath0671.90062OpenAlexW2165321101MaRDI QIDQ3824112

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 analysis quadratic function proximal point sum of proper closed convex functions

Mathematics Subject Classification ID

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

Related Items (5)

On the structure of convex piecewise quadratic functions ⋮ Dual coordinate ascent methods for non-strictly convex minimization ⋮ A parallel descent algorithm for convex programming ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3824112&oldid=17410994"