Semi-infinite terminal problems: a newton type method
Author:
- 1 January 1998
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 44 (1) , 25-48
Abstract
A semi-infinite terminal problem is a special kind of generalized semi-infinite problem of the following type: Given a one-parametric family of feasible sets described by an infinite number of inequality constraints, find the maximal value of the parameter for which he feasible set is nonempty In this paper, an algorithm for the solution of such a problem is given. In each step of the algorithm, a parametric auxiliary problem is solved for a fixed parameter. A sequence of parameters is generated that converges to the optimal value. In each step, for the computation of the next parameter a pair of a primal and a dual solution of the parametric auxiliary problem is used The sensitivity information contained in the dual solutions yields fast convergence. In fact, superlinear convergence of the algorithm is proven. This result is also valid in the case of ill-posed problems. The proof is based on a result on the one-sided Iderivatives of the optimal value function of the auxiliary problemKeywords
This publication has 8 references indexed in Scilit:
- On the numerical treatment of a class of semi-infinite terminal problems∗∗Partially supported by the german research society (DFG)$ef:Optimization, 1997
- A Fast Algorithm for a Class of Generalized Fractional ProgramsManagement Science, 1996
- Corrigendum: One-Sided Derivatives For The Value Function In Convex Parametric ProgrammingOptimization, 1996
- One-sided derivatives for the value function in convex parametric programmingOptimization, 1994
- An Algorithm for General Restricted Rational Chebyshev ApproximationSIAM Journal on Numerical Analysis, 1990
- Analysis Now1989
- The acceleration radius: a global performance measure for robotic manipulatorsIEEE Journal on Robotics and Automation, 1988
- Funktionalanalysis1986