A smoothing projected Newton-type algorithm for semi-infinite programming

DOI10.1007/s10589-007-9117-xzbMath1153.90556MaRDI QIDQ1001204

Liqun Qi, Xiaojiao Tong, Guanglu Zhou, Chen Ling

Publication date: 13 February 2009

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

Full work available at URL: http://hdl.handle.net/20.500.11937/37908

zbMATH Keywords

Convergence; Semi-infinite programming; KKT system; Constrained equations; Smoothing method

Mathematics Subject Classification ID

90C53: Methods of quasi-Newton type

90C39: Dynamic programming

Related Items

A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of monotone complementarity problems with locally Lipschitzian functions
• Optimization. Algorithms and consistent approximations
• A feasible semismooth asymptotically Newton method for mixed complementarity problems
• 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
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A nonsmooth version of Newton's method
• Global convergence of a robust smoothing SQP method for semi-infinite programming
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• Nonsmooth Equations: Motivation and Algorithms
• Semi-Infinite Programming: Theory, Methods, and Applications
• An iterative method for solving KKT system of the semi-infinite programming
• A projected lagrangian algorithm for semi-infinite programming
• Projected gradient methods for linearly constrained problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Computational discretization algorithms for functional inequality constrained optimization
• Semi-infinite programming. Recent advances
• Discretization in semi-infinite programming: the rate of convergence