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

DOI10.1080/1055678021000012453zbMath1032.90043OpenAlexW2069211058MaRDI QIDQ4806374

V. A. Skokov, Klaus Beer

Publication date: 22 March 2004

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites Work

• The Cutting-Plane Method for Solving Convex Programs
• On the finite extension of the marginal function arising in decomposition algorithms¹
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Unnamed Item
• Unnamed Item

This page was built for publication: Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints