A cutting-plane method for quadratic semi infinite programming problems
From MaRDI portal
Recommendations
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- A cutting plane approach to solving quadratic infinite programs on measure spaces.
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Analytic center based cutting plane method for linear semi-infinite programming.
- scientific article; zbMATH DE number 3984967
Cites work
- A cutting-plane algorithm with linear and geometric rates of convergence
- Cutting-Plane Methods without Nested Constraint Sets
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- Infinitely constrained optimization problems
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- On cutoff optimization methods in infinite-dimensional spaces and applications
- Solving Optimization Problems with many Constraints by a Sequence of Subproblems Containing only two Constraints
- Stability of the solution of definite quadratic programs
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(35)- A semi-infinite programming method for approximating load duration curves by polynomials
- Discretization methods for the solution of semi-infinite programming problems
- Some outer approximation methods for semi-infinite optimization problems
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An approximation approach to non-strictly convex quadratic 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
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- A relaxed cutting plane algorithm for solving the Vasicek-type forward interest rate model
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- A unifying framework for several cutting plane methods for semidefinite programming
- Feasible method for semi-infinite programs
- On the resolution of the Vasicek-type interest rate model
- scientific article; zbMATH DE number 3984967 (Why is no real title available?)
- A relaxed cutting plane algorithm for solving fuzzy inequality systems
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- scientific article; zbMATH DE number 1046860 (Why is no real title available?)
- scientific article; zbMATH DE number 1054740 (Why is no real title available?)
- Solving Quadratic Programming by Cutting Planes
- scientific article; zbMATH DE number 6135091 (Why is no real title available?)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Solving fuzzy variational inequalities over a compact set
- A cutting plane approach to solving quadratic infinite programs on measure spaces.
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- Convex semi-infinite programming algorithms with inexact separation oracles
- A note on an implementation of a method for quadratic semi-infinite programming
This page was built for publication: A cutting-plane method for quadratic semi infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815873)
