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

DOI10.1007/S40314-013-0013-YMaRDI QIDQ2392971zbMATH OpenOpenAlexFDO

Authors Weiai Liu, Changyu 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 convergencesuperlinear convergenceFB functionGSIP problemsmoothing L-M method

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Recommendations

• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
• A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
• A smoothing Newton method for semi-infinite programming
• A smoothing projected Newton-type algorithm for semi-infinite programming
• Global convergence of a robust smoothing SQP method for semi-infinite programming

Cites work

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

Cited in

(9)

• An accelerated augmented Lagrangian method for multi-criteria optimization problem
• A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations
• scientific article; zbMATH DE number 6692416 (Why is no real title available?)
• Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.
• Distributionally robust parameter identification of a time-delay dynamical system with stochastic measurements
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
• A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
• Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
• A Levenberg-Marquardt type algorithm with a Broyden-like update technique for solving nonlinear equations

Describes a project that uses

Uses Software

• SIPAMPL

This page was built for publication: A smoothing Levenberg-Marquardt method for generalized semi-infinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392971)