An iterative method for solving KKT system of the semi-infinite programming

DOI10.1080/10556780500094739zbMath1127.90410OpenAlexW2020633601MaRDI QIDQ3369516

Soon-Yi Wu, Liqun Qi, Guanglu Zhou, Dong-hui Li

Publication date: 2 February 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

semi-infinite programmingKKT systemsemismooth equation

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34)

Related Items (21)

Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Feasible Method for Semi-Infinite Programs ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ A semi-infinite programming approach to two-stage stochastic linear programs with high-order moment constraints ⋮ On the convergence of a smoothed penalty algorithm for semi-infinite programming ⋮ Recent contributions to linear semi-infinite optimization ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ Unnamed Item ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ New approach for the nonlinear programming with transient stability constraints arising from power systems ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems ⋮ An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems ⋮ A new adaptive method to nonlinear semi-infinite programming ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming

Uses Software

• FSQP

Cites Work

• Globally convergent methods for semi-infinite programming
• A recursive quadratic programming algorithm for semi-infinite optimization problems
• A globally convergent SQP method for semi-infinite nonlinear optimization
• Optimization. Algorithms and consistent approximations
• Semismooth Newton methods for solving semi-infinite programming problems
• A nonsmooth version of Newton's method
• Semi-Infinite Programming: Theory, Methods, and Applications
• A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
• A projected lagrangian algorithm for semi-infinite programming
• Optimization and nonsmooth analysis
• A special newton-type optimization method
• Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Local Convergence of SQP Methods in Semi-Infinite Programming
• Computational discretization algorithms for functional inequality constrained optimization

This page was built for publication: An iterative method for solving KKT system of the semi-infinite programming