Global convergence of a semi-infinite optimization method

DOI10.1007/BF01445158zbMath0698.65039MaRDI QIDQ912572

Bradley M. Bell

Publication date: 1990

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

algorithmconvergencenondifferentiable optimizationsemi-infinite programmingtrust region methodsnumerical testing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Optimality conditions in nondifferentiable programming and their applications to best approximations
• A recursive quadratic programming algorithm for semi-infinite optimization problems
• An outer approximations algorithm for computer-aided design problems
• Convergence Properties of Algorithms for Nonlinear Optimization
• Local properties of algorithms for minimizing nonsmooth composite functions
• A projected lagrangian algorithm for semi-infinite programming
• Conditions for convergence of trust region algorithms for nonsmooth optimization
• Descent methods for composite nondifferentiable optimization problems
• Exact penalty functions and stability in locally Lipschitz programming
• An exact penalty function for semi-infinite programming
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• An improved algorithm for optimization problems with functional inequality constraints
• Newton’s Method with a Model Trust Region Modification
• An algorithm for optimization problems with functional inequality constraints
• A New Approach to Lagrange Multipliers
• Convex Analysis

This page was built for publication: Global convergence of a semi-infinite optimization method