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

DOI10.1016/j.cam.2009.01.004zbMath1179.65070OpenAlexW2051706781MaRDI QIDQ2390009

Cheng Ma, Chang-Yu 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 convergencesemi-infinite programmingnonsmoothlocal error bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (2)

Smoothing SQP algorithm for semismooth equations with box constraints ⋮ A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations

Cites Work

• Unnamed Item
• Unnamed Item
• A note on an implementation of a method for quadratic semi-infinite programming
• Globally convergent methods for semi-infinite programming
• On NCP-functions
• Discretization methods for the solution of semi-infinite programming problems
• Semismooth Newton methods for solving semi-infinite programming problems
• A smoothing Newton method for semi-infinite programming
• Numerical experiments in semi-infinite programming
• A nonsmooth version of Newton's method
• An implementation of a discretization method for semi-infinite programming
• Logarithmic Barrier Decomposition Methods 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

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