Separating plane algorithms for convex optimization

DOI10.1007/BF02614389MaRDI QIDQ1356051zbMATH OpenFDO

Authors Evgeni A. Nurminski

Publication date 4 June 1997

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02614389

zbMATH Keywords

approximation of the epigraphconjugate functionconvex optimizationseparating plane algorithms

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 1166327
• A class of convex programming methods
• Multiple Cuts in Separating Plane Algorithms
• scientific article; zbMATH DE number 195045

Cites work

• A bracketing technique to ensure desirable convergence in univariate minimization
• A rapidly convergent five-point algorithm for univariate minimization
• A stable method for solving certain constrained least squares problems
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Exact penalty functions in nonlinear programming
• Finding the nearest point in A polytope
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• scientific article; zbMATH DE number 3930735 (Why is no real title available?)
• scientific article; zbMATH DE number 4007605 (Why is no real title available?)
• scientific article; zbMATH DE number 4119948 (Why is no real title available?)
• scientific article; zbMATH DE number 3800430 (Why is no real title available?)
• scientific article; zbMATH DE number 3428782 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• Proximity control in bundle methods for convex nondifferentiable minimization
• Superlinear convergence in convex nondifferentiable optimization
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(12)

• Maximum compatibility method for data fitting under interval uncertainty
• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
• Computational experience and challenges with the conjugate epi-projection algorithms for non-smooth optimization
• Polyhedral separation via difference of convex (DC) programming
• Maximum consistency method for data fitting under interval uncertainty
• A class of convex programming methods
• scientific article; zbMATH DE number 1166327 (Why is no real title available?)
• Algorithmes de type F.A.C. en optimisation convexe
• Fast Combinatorial Algorithm for Tightly Separating Hyperplanes
• A splitting bundle approach for non-smooth non-convex minimization
• Weak and strong compatibility in data fitting problems under interval uncertainty
• Synthesis of cutting and separating planes in a nonsmooth optimization method

This page was built for publication: Separating plane algorithms for convex optimization

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