Semi-infinite terminal problems: a newton type method

DOI10.1080/02331939808844398zbMath0916.65066OpenAlexW2089581686WikidataQ104129327 ScholiaQ104129327MaRDI QIDQ4224666

Martin Gugat

Publication date: 1998

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844398

zbMATH Keywords

algorithmdualityNewton methodill-posed problemssuperlinear convergenceSlater conditionsemi-infinite optimizationsemi-infinite terminal problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)

Related Items (1)

Generalized semi-infinite programming: a tutorial

Cites Work

• An Algorithm for General Restricted Rational Chebyshev Approximation
• One-sided derivatives for the value function in convex parametric programming
• On the numerical treatment of a class of semi-infinite terminal problems^∗∗Partially supported by the german research society (DFG)$ef:
• A Fast Algorithm for a Class of Generalized Fractional Programs
• Corrigendum: One-Sided Derivatives For The Value Function In Convex Parametric Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Semi-infinite terminal problems: a newton type method