A cutting-plane method for quadratic semi infinite programming problems
- 1 January 1988
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 19 (6) , 803-817
- https://doi.org/10.1080/02331938808843393
Abstract
A cutting plane algorithm for solving convex quadratic semi-infinite programming problems is presented. Nonbinding constraints can be dropped. Its arithmetic convergence rate is proved by taking into consideration the error of the approximate solution of the auxiliary problem to calculate the most violate constraint. An implementable variant of this method is described which is due to the adaptive discretization of the index set and its stability is shown. Computational experiments show the behaviour of the method.Keywords
This publication has 10 references indexed in Scilit:
- A cutting-plane algorithm with linear and geometric rates of convergenceJournal of Optimization Theory and Applications, 1982
- Numerische Methoden der Approximation und semi-infiniten OptimierungPublished by Springer Nature ,1982
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations AlgorithmsSIAM Journal on Control and Optimization, 1979
- Infinitely constrained optimization problemsJournal of Optimization Theory and Applications, 1976
- Solving Optimization Problems with many Constraints by a Sequence of Subproblems Containing only two ConstraintsMathematische Nachrichten, 1976
- Stability of the solution of definite quadratic programsMathematical Programming, 1973
- On cutoff optimization methods in infinite-dimensional spaces and applicationsJournal of Optimization Theory and Applications, 1973
- Generalized Cutting Plane AlgorithmsSIAM Journal on Control, 1971
- Cutting-Plane Methods without Nested Constraint SetsOperations Research, 1970
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960