On the finite extension of the marginal function arising in decomposition algorithms1

DOI10.1080/02331938808843382zbMath0663.90067OpenAlexW1991659588MaRDI QIDQ3815139

G. Dils, Klaus Beer

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843382

zbMATH Keywords

exact penalty methodlarge scale nonlinear programmingprimal decompositioncontinuation of a convex functionconvex optimal-value function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (1)

Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints

Cites Work

• Finite extensions of convex functions
• Convex Analysis

This page was built for publication: On the finite extension of the marginal function arising in decomposition algorithms¹