Global convergence of a robust smoothing SQP method for semi-infinite programming

DOI10.1007/s10957-006-9049-0zbMath1140.90044OpenAlexW2002833707MaRDI QIDQ2370033

Guanglu Zhou, Liqun Qi, Soon-Yi Wu, Chen Ling

Publication date: 21 June 2007

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-006-9049-0

zbMATH Keywords

global convergencesemi-infinite programmingsmoothing SQP methodintegral function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semi-infinite programming (90C34) Methods of successive quadratic programming type (90C55)

Related Items

A smoothing Levenberg-Marquardt method for generalized semi-infinite programming, On the convergence of a smoothed penalty algorithm 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 smoothing SQP method for nonlinear programs with stability constraints arising from power systems, A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints, A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset, A smoothing projected Newton-type algorithm for semi-infinite programming, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, Convergence properties of a class of exact penalty methods for semi-infinite optimization problems, A smoothing Levenberg-Marquardt algorithm for semi-infinite programming

Cites Work

• Unnamed Item
• A globally convergent SQP method for semi-infinite nonlinear optimization
• Semismooth Newton methods for solving semi-infinite programming problems
• Differentiability and semismoothness properties of integral functions and their applications
• A smoothing Newton method for semi-infinite programming
• A new computational algorithm for functional inequality constrained optimization problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• On the use of ε-most-active constraints in an exact penalty function method for nonlinear optimization
• A projected lagrangian algorithm for semi-infinite programming
• Optimization and nonsmooth analysis
• An improved algorithm for optimization problems with functional inequality constraints
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• Computational discretization algorithms for functional inequality constrained optimization