On the problem polyhedral separability: a numerical solution

DOI10.1134/S0005117915100082zbMath1354.90099MaRDI QIDQ268664

Alexander S. Strekalovsky, Tatiana V. Gruzdeva, Andrey Vasil'evich Orlov

Publication date: 15 April 2016

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (3)

On solving the sum-of-ratios problem ⋮ On a Solving Bilevel D.C.-Convex Optimization Problems ⋮ Polyhedral separation via difference of convex (DC) programming

Uses Software

• PLCP
• SQPlab

Cites Work

• DC models for spherical separation
• On the complexity of polyhedral separability
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The problem of spherical binary separability
• Piecewise Linear Classifiers Based on Nonsmooth Optimization Approaches
• On Solving Optimization Problems with Hidden Nonconvex Structures
• Numerical Optimization
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Polyhedral separability through successive LP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the problem polyhedral separability: a numerical solution