A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
From MaRDI portal
KKT systemnonsmooth equationsoptimizationsemi-infinite programming problemsmoothing Levenberg-Marquardt algorithmsuperlinear convergence
Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Numerical methods for variational inequalities and related problems (65K15) Nonlinear programming (90C30) Semi-infinite programming (90C34) Optimality conditions and duality in mathematical programming (90C46)
Recommendations
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
- Global convergence of a robust smoothing SQP method for semi-infinite programming
Cites work
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A dual parametrization method for convex semi-infinite programming
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
- A new computational algorithm for functional inequality constrained optimization problems
- 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 smoothing projected Newton-type algorithm for semi-infinite programming
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- An iterative method for solving KKT system of the semi-infinite programming
- Computational discretization algorithms for functional inequality constrained optimization
- Computing a Trust Region Step
- Critical sets in parametric optimization
- Differentiability and semismoothness properties of integral functions and their applications
- Discretization in semi-infinite programming: the rate of convergence
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- scientific article; zbMATH DE number 3810823 (Why is no real title available?)
- scientific article; zbMATH DE number 1186921 (Why is no real title available?)
- scientific article; zbMATH DE number 3677558 (Why is no real title available?)
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Numerical treatment of a class of semi‐infinite programming problems
- On Linear Semi-Infinite Programming Problems: An Algorithm
- Optimization and nonsmooth analysis
- Semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semismooth Newton methods for solving semi-infinite programming problems
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
Cited in
(18)- A smoothing projected Newton-type algorithm for semi-infinite programming
- 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 nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- scientific article; zbMATH DE number 6692416 (Why is no real title available?)
- scientific article; zbMATH DE number 5670484 (Why is no real title available?)
- Generalized tensor complementarity problems over a polyhedral cone
- Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications
- A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem
- A Levenberg-Marquardt type algorithm with a Broyden-like update technique for solving nonlinear equations
- A computationally improved Levenberg-Marquardt method for systems of inequalities
- A variant Levenberg-Marquardt-type method for underdetermined nonsmooth equations
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
This page was built for publication: A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352422)
