scientific article; zbMATH DE number 3984967
From MaRDI portal
Publication:3748063
Recommendations
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- A cutting-plane method for quadratic semi infinite programming problems
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A relaxed cutting plane method for semi-infinite semi-definite programming
- A cutting plane algorithm for solving linear bilevel programs
- scientific article; zbMATH DE number 1182577
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- A cutting plane algorithm for linear reverse convex programs
Cited in
(9)- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Analytic center based cutting plane method for linear semi-infinite programming.
- A unifying framework for several cutting plane methods for semidefinite programming
- A cutting-plane method for quadratic semi infinite programming problems
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748063)
