Local convergence analysis of projection-type algorithms: unified approach (Q1810933): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 10:00, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Local convergence analysis of projection-type algorithms: unified approach	scientific article

Statements

scholarly article

0 references

Local convergence analysis of projection-type algorithms: unified approach (English)

0 references

Journal of Optimization Theory and Applications

0 references

publication date

9 June 2003

0 references

zbMATH Keywords

variational inequalities

0 references

projection methods

0 references

local convergence

0 references

0 references

Zhang, Jianzhong

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

0 references

0 references

Modification of the extra-gradient method for solving variational inequalities and certain optimization problems

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Solution of symmetric linear complementarity problems by iterative methods

0 references

On the convergence of a basic iterative method for the implicit complementarity problem

0 references

Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems

0 references

Projected gradient methods for linearly constrained problems

0 references

On the Identification of Active Constraints

0 references

Exposing Constraints

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

On linear convergence of iterative methods for the variational inequality problem

0 references

Local convergence behavior of some projection-type methods for affine variational inequalities

0 references

Convergence properties of projection and contraction methods for variational inequality problems

0 references

On the Accurate Identification of Active Constraints

0 references

Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space

0 references

Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities

0 references

Weak Sharp Solutions of Variational Inequalities

0 references

Convergence properties of feasible descent methods for solving variational inequalities in Banach spaces

0 references

Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions

0 references

Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems

0 references

0 references

An iterative algorithm for the variational inequality problem

0 references

A new method for a class of linear variational inequalities

0 references

A class of projection and contraction methods for monotone variational inequalities

0 references

Solution of projection problems over polytopes

0 references

Modified Projection-Type Methods for Monotone Variational Inequalities

0 references

A class of iterative methods for solving nonlinear projection equations

0 references

A New Projection Method for Variational Inequality Problems

0 references

A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space

0 references

Proximal Minimization Methods with Generalized Bregman Functions

0 references

Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities

0 references

0 references

Convergence Rates in Forward--Backward Splitting

0 references

The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem

0 references

0 references

Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming

0 references

Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities

0 references

A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings

0 references

A globally convergent Newton method for solving strongly monotone variational inequalities

0 references

A hybrid Newton method for solving the variational inequality problem via the D-gap function

0 references

Projected Newton Methods for Optimization Problems with Simple Constraints

0 references

An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints

0 references

Two-Metric Projection Methods for Constrained Optimization

0 references

Newton's Method for Large Bound-Constrained Optimization Problems

0 references

Family of projected descent methods for optimization problems with simple bounds

0 references

full work available at URL

https://doi.org/10.1023/a:1019637315803

0 references

Identifiers

zbMATH Open document ID

0 references

10.1023/A:1019637315803

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1810933

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1810933&oldid=37193354"