A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems

DOI10.1016/J.CAM.2009.01.004MaRDI QIDQ2390009zbMATH OpenOpenAlexFDO

Authors Cheng Ma, Changyu Wang

Publication date 20 July 2009

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

Full work available at URL https://doi.org/10.1016/j.cam.2009.01.004

zbMATH Keywords

global convergencenonsmoothsemi-infinite programminglocal error bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Recommendations

• A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
• A Levenberg-Marquardt algorithm for solving nonsmooth equations
• A smoothing Levenberg-Marquardt method for nonlinear complementarity problems
• A modified Levenberg-Marquardt method for nonsmooth equations with finitely many maximum functions
• A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
• Semismooth Newton methods for solving semi-infinite programming problems
• scientific article; zbMATH DE number 1215251
• scientific article; zbMATH DE number 3950219

Cites work

• scientific article; zbMATH DE number 1186921 (Why is no real title available?)
• scientific article; zbMATH DE number 3659282 (Why is no real title available?)
• A nonsmooth version of Newton's method
• A note on an implementation of a method for quadratic semi-infinite programming
• A smoothing Newton method for semi-infinite programming
• An implementation of a discretization method for semi-infinite programming
• Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
• Discretization in semi-infinite programming: the rate of convergence
• Discretization methods for the solution of semi-infinite programming problems
• Globally convergent methods for semi-infinite programming
• Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
• Numerical experiments in semi-infinite programming
• On NCP-functions
• Semismooth Newton methods for solving semi-infinite programming problems

Cited in

(8)

• A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
• Smoothing SQP algorithm for semismooth equations with box constraints
• A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
• A Parameter-Self-Adjusting Levenberg-Marquardt Method for Solving Nonsmooth Equations
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
• Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements
• An iterative method for solving KKT system of the semi-infinite programming
• A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations

This page was built for publication: A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems

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