Semismooth Newton methods for solving semi-infinite programming problems
From MaRDI portal
Publication:1407248
DOI10.1023/A:1024814401713zbMath1033.90137OpenAlexW1630757954MaRDI QIDQ1407248
Soon-Yi Wu, Guanglu Zhou, Liqun Qi
Publication date: 15 September 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024814401713
Related Items
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 ⋮ Global convergence of a robust smoothing SQP method for semi-infinite programming ⋮ Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ Smoothing SQP algorithm for semismooth equations with box constraints ⋮ A homotopy interior point method for semi-infinite programming problems ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard ⋮ A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems ⋮ On the smoothing of the square-root exact penalty function for inequality constrained optimization ⋮ A smoothing Levenberg-Marquardt method for generalized semi-infinite programming ⋮ A second-order smooth penalty function algorithm for constrained optimization problems ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ On the convergence of a smoothed penalty algorithm for semi-infinite programming ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ 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 ⋮ An augmented Lagrangian algorithm for solving semiinfinite programming ⋮ A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints ⋮ The semismooth approach for semi-infinite programming under the reduction ansatz ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems ⋮ How to solve a semi-infinite optimization problem ⋮ 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 Newton method for semi-infinite programming ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ An iterative method for solving KKT system of the semi-infinite programming ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ A filter trust region method for solving semi-infinite programming problems ⋮ Interior point filter method for semi-infinite programming problems ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
