Separating plane algorithms for convex optimization

DOI10.1007/BF02614389zbMath0872.90073MaRDI QIDQ1356051

Evgeni A. Nurminski

Publication date: 4 June 1997

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

zbMATH Keywords

convex optimizationconjugate functionapproximation of the epigraphseparating plane algorithms

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Maximum compatibility method for data fitting under interval uncertainty, Maximum consistency method for data fitting under interval uncertainty, A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence, Synthesis of cutting and separating planes in a nonsmooth optimization method, A splitting bundle approach for non-smooth non-convex minimization, Weak and Strong Compatibility in Data Fitting Problems Under Interval Uncertainty

Cites Work

• Proximity control in bundle methods for convex nondifferentiable minimization
• A bracketing technique to ensure desirable convergence in univariate minimization
• A rapidly convergent five-point algorithm for univariate minimization
• The Cutting-Plane Method for Solving Convex Programs
• Exact penalty functions in nonlinear programming
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Finding the nearest point in A polytope
• A stable method for solving certain constrained least squares problems
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item