A smoothing Levenberg-Marquardt method for generalized semi-infinite programming

DOI10.1007/s40314-013-0013-yzbMath1291.90272MaRDI QIDQ2392971

Weiai Liu, Chang-Yu Wang

Publication date: 5 August 2013

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-013-0013-y

zbMATH Keywords

global convergence; superlinear convergence; FB function; GSIP problem; smoothing L-M method

Mathematics Subject Classification ID

90C34: Semi-infinite programming

Related Items

Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem, Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems., A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations, Distributionally robust parameter identification of a time-delay dynamical system with stochastic measurements, An accelerated augmented Lagrangian method for multi-criteria optimization problem

Uses Software

• SIPAMPL

Cites Work

• Unnamed Item
• On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
• Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
• The semismooth approach for semi-infinite programming under the reduction ansatz
• First order optimality conditions for generalized semi-infinite programming problems
• Augmented lagrangians in semi-infinite programming
• A new smoothing Newton-type algorithm for semi-infinite programming
• On NCP-functions
• Semismooth Newton methods for solving semi-infinite programming problems
• A smoothing Newton method for semi-infinite programming
• Generalized semi-infinite programming: Theory and methods
• A nonsmooth version of Newton's method
• Global convergence of a robust smoothing SQP method for semi-infinite programming
• The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity
• An implementation of a discretization method for semi-infinite programming
• Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
• Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• A trust region method for semi-infinite programming problems
• SIPAMPL
• Convex Analysis