A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
From MaRDI portal
Publication:2392971
DOI10.1007/S40314-013-0013-YzbMATH Open1291.90272OpenAlexW2007405950MaRDI QIDQ2392971FDOQ2392971
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
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
- SIPAMPL
- Convex Analysis
- A nonsmooth version of Newton's method
- Title not available (Why is that?)
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- On NCP-functions
- Semismooth Newton methods for solving semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- An implementation of a discretization method for semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
- Generalized semi-infinite programming: Theory and methods
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- First order optimality conditions for generalized semi-infinite programming problems
- A trust region method for semi-infinite programming problems
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
- Augmented lagrangians in semi-infinite programming
- 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
- The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity
Cited In (8)
- An accelerated augmented Lagrangian method for multi-criteria optimization problem
- 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.
- Distributionally robust parameter identification of a time-delay dynamical system with stochastic measurements
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
- A Levenberg-Marquardt type algorithm with a Broyden-like update technique for solving nonlinear equations
- Title not available (Why is that?)
- A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations
Uses Software
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)
