A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
From MaRDI portal
Publication:5470236
DOI10.1137/040619867zbMath1131.90064OpenAlexW2064244768MaRDI QIDQ5470236
Liqun Qi, Chen Ling, Qin Ni, Kok Lay Teo
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/4764
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Numerical methods based on necessary conditions (49M05) Semi-infinite programming (90C34)
Related Items (13)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ 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 ⋮ 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 spline smoothing homotopy method for nonconvex nonlinear programming ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ A smoothing approach for the optimal parameter selection problem with continuous inequality constraint ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
Uses Software
This page was built for publication: A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
