An algorithm for finding a solution to the inclusion 0 F(x)
From MaRDI portal
DOI10.1007/BF00939647zbMATH Open0697.49029OpenAlexW2120231703MaRDI QIDQ911036FDOQ911036
Authors: 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
Recommendations
- Solving nonsmooth inclusions in the convex case
- Solving monotone inclusions with linear multi-step methods.
- On the convergence of some methods for variational inclusions
- On a general scheme for solving inclusions using derivatives of set-valued mappings
- A two-step Steffensen-type method for nonsmooth variational inclusions
Numerical mathematical programming methods (65K05) Mathematical programming (90C99) Nonlinear algebraic or transcendental equations (65H99)
Cites Work
- Regularity and stability for the mathematical programming problem in Banach spaces
- Optimization and nonsmooth analysis
- Regularity and Stability for Convex Multivalued Functions
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- A Gauss-Newton Approach to Solving Generalized Inequalities
- First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems
- Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
- A global quadratic algorithm for solving a system of mixed equalities and inequalities
- Locally Lipschitzian set-valued maps and generalized extremal problems with inclusion constraints
This page was built for publication: An algorithm for finding a solution to the inclusion 0\(\in F(x)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911036)
