Globally convergent methods for semi-infinite programming
From MaRDI portal
Publication:1159954
DOI10.1007/BF01941472zbMath0476.65049OpenAlexW2045551432MaRDI QIDQ1159954
Publication date: 1981
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01941472
Related Items (16)
An interior semi-infinite programming method ⋮ A homotopy interior point method for semi-infinite programming problems ⋮ A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems ⋮ An exact penalty function for semi-infinite programming ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications ⋮ A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming ⋮ A quasi-Newton interior point method for semi-infinite programming ⋮ A smoothing Newton method for semi-infinite programming ⋮ An iterative method for solving KKT system of the semi-infinite programming ⋮ A globally convergent SQP method for semi-infinite nonlinear optimization ⋮ An exact penalty function algorithm for semi-infinite programmes ⋮ Numerical experiments in semi-infinite programming ⋮ A reduction method for semi-infinite programming by means of a global stochastic approach† ⋮ A fast algorithm for the optimal design of high accuracy windows in signal processing ⋮ A projected lagrangian algorithm for semi-infinite programming
Cites Work
- A globally convergent method for nonlinear programming
- Semi-infinite programming. Proceedings of a workshop Bad Honnef August 30 - September 1, 1978
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- A New Approach to Lagrange Multipliers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Globally convergent methods for semi-infinite programming
