On the convergence of a smoothed penalty algorithm for semi-infinite programming

DOI10.1007/s00186-013-0440-yzbMath1291.90271OpenAlexW2058001002MaRDI QIDQ376724

Qian Liu, Yang, Xinmin, Chang-Yu Wang

Publication date: 19 November 2013

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-013-0440-y

zbMATH Keywords

semi-infinite programmingsmoothing function\(l_{p}\) exact penalty functionpenalty algorithmsmoothed penalty function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Semi-infinite programming (90C34)

Related Items

Non-convex semi-infinite min-max optimization with noncompact sets ⋮ Convergence properties of a class of exact penalty methods for semi-infinite optimization problems

Cites Work

• A smoothing projected Newton-type algorithm for semi-infinite programming
• Optimization. Algorithms and consistent approximations
• 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
• Numerical experiments in semi-infinite programming
• Global convergence of a robust smoothing SQP method for semi-infinite programming
• Smoothed penalty algorithms for optimization of nonlinear models
• Semi-Infinite Programming: Theory, Methods, and Applications
• The smoothed-penalty algorithm for state constrained optimal control problems for partial differential equations
• An iterative method for solving KKT system of the semi-infinite programming
• An exact penalty function for semi-infinite programming
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization
• An exact lower order penalty function and its smoothing in nonlinear programming
• A smoothed penalty iteration for state constrained optimal control problems for partial differential equations
• Penalty and Barrier Methods: A Unified Framework
• Mathematical Programs with Equilibrium Constraints
• Discretization in semi-infinite programming: the rate of convergence