An algorithm for finding a solution to the inclusion 0\(\in F(x)\)

DOI10.1007/BF00939647zbMath0697.49029OpenAlexW2120231703MaRDI QIDQ911036

N. E. Zubov

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939647

zbMATH Keywords

support functionset-valued mapinclusiongeneralized inequalitiesArmijo stepsize rule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mathematical programming (90C99) Nonlinear algebraic or transcendental equations (65H99)

Cites Work

• Locally Lipschitzian set-valued maps and generalized extremal problems with inclusion constraints
• Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
• Regularity and stability for the mathematical programming problem in Banach spaces
• Optimization and nonsmooth analysis
• A Gauss-Newton Approach to Solving Generalized Inequalities
• Regularity and Stability for Convex Multivalued Functions
• A global quadratic algorithm for solving a system of mixed equalities and inequalities
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems

This page was built for publication: An algorithm for finding a solution to the inclusion 0\(\in F(x)\)