On the problem polyhedral separability: a numerical solution
From MaRDI portal
Publication:268664
DOI10.1134/S0005117915100082zbMATH Open1354.90099MaRDI QIDQ268664FDOQ268664
Authors: A. S. Strekalovskiĭ, Tatiana V. Gruzdeva, Andrey Vasil'evich Orlov
Publication date: 15 April 2016
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- On the complexity of polyhedral separability
- scientific article; zbMATH DE number 5066290
- On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
- Separation and approximation of polyhedral objects
- The vertex separator problem: a polyhedral investigation
- scientific article; zbMATH DE number 742976
- On numerical solving the spherical separability problem
- Polyhedral separability through successive LP
- Separation via polyhedral conic functions
- A linear algorithm for determining the separation of convex polyhedra
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Numerical Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear and Nonlinear Separation of Patterns by Linear Programming
- Polyhedral separability through successive LP
- DC models for spherical separation
Cited In (13)
- Algorithms of quasidifferentiable optimization for the separation of point sets
- On solving the sum-of-ratios problem
- Title not available (Why is that?)
- Separation of two sets by piecewise linear function
- A Separation Algorithm for b-Matching Degree-Sequence Polyhedra
- On numerical solving the spherical separability problem
- Title not available (Why is that?)
- Polyhedral separability through successive LP
- On a solving bilevel d.c.-convex optimization problems
- Separation of convex polyhedral sets with column parameters
- Exact separation of \(k\)-projection polytope constraints
- Polyhedral separation via difference of convex (DC) programming
- Title not available (Why is that?)
Uses Software
This page was built for publication: On the problem polyhedral separability: a numerical solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q268664)