Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
From MaRDI portal
Recommendations
- A cutting-plane method for quadratic semi infinite programming problems
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- On solving convex quadratic semi-infinite programming probelms
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Algorithms – ESA 2005
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
Cites work
- A Fast Algorithm for Linear Complex Chebyshev Approximations
- A one-phase algorithm for semi-infinite linear programming
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- An interior point algorithm for semi-infinite linear programming
- Entropy optimization and mathematical programming
- scientific article; zbMATH DE number 439946 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 3659282 (Why is no real title available?)
- scientific article; zbMATH DE number 3677558 (Why is no real title available?)
- scientific article; zbMATH DE number 3581537 (Why is no real title available?)
- scientific article; zbMATH DE number 776087 (Why is no real title available?)
- scientific article; zbMATH DE number 830380 (Why is no real title available?)
- Numerical treatment of a class of semi‐infinite programming problems
- On Linear Semi-Infinite Programming Problems: An Algorithm
- On solving convex quadratic semi-infinite programming probelms
- On the Implementation of a Primal-Dual Interior Point Method
- Optimization. Algorithms and consistent approximations
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
Cited in
(16)- A class of comprehensive constraints for design of PCWLSE Laguerre and FIR filters: a boost in performance
- 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
- Detecting and solving aircraft conflicts using bilevel programming
- Non-convex semi-infinite min-max optimization with noncompact sets
- Algorithms for infinite quadratic programming in \(L_p\) spaces
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A cutting-plane method for quadratic semi infinite programming problems
- Solving semi-infinite programs by smoothing projected gradient method
- A solution method for combined semi-infinite and semi-definite programming
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- Convex optimization for group feature selection in networked data
- Learning data manifolds with a cutting plane method
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
This page was built for publication: Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936072)
