Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756): 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	Error bounds and convergence analysis of feasible descent methods: A general approach	scientific article

Statements

scholarly article

0 references

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

0 references

0 references

0 references

Annals of Operations Research

0 references

publication date

7 February 1994

0 references

zbMATH Keywords

survey

0 references

rate of convergence

0 references

feasible descent methods

0 references

error bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

On the Goldstein-Levitin-Polyak gradient projection method

0 references

Projected Newton Methods for Optimization Problems with Simple Constraints

0 references

Projection methods for variational inequalities with application to the traffic assignment problem

0 references

0 references

0 references

On the gradient-projection method for solving the nonsymmetric linear complementarity problem

0 references

The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation

0 references

Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes

0 references

On the convergence of projected gradient processes to singular critical points

0 references

Two-Metric Projection Methods for Constrained Optimization

0 references

Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities

0 references

Convex programming in Hilbert space

0 references

On the Convergence of the Proximal Point Algorithm for Convex Minimization

0 references

On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method

0 references

On the convergence properties of Hildreth's quadratic programming algorithm

0 references

On the Solution of Singular and Semidefinite Linear Systems by Iteration

0 references

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

0 references

0 references

Combined Primal–Dual and Penalty Methods for Convex Programming

0 references

Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem

0 references

Iterative Methods for Large Convex Quadratic Programs: A Survey

0 references

0 references

On a global error bound for a class of monotone affine variational inequality problems

0 references

On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem

0 references

On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization

0 references

On the convergence of the coordinate descent method for convex differentiable minimization

0 references

Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem

0 references

On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization

0 references

Solution of symmetric linear complementarity problems by iterative methods

0 references

Sparsity-preserving SOR algorithms for separable quadratic and linear programming

0 references

Error bounds for nondegenerate monotone linear complementarity problems

0 references

Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem

0 references

Global error bounds for monotone affine variational inequality problems

0 references

Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs

0 references

Error bounds for monotone linear complementarity problems

0 references

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

0 references

0 references

0 references

Error bounds for the linear complementarity problem with a P-matrix

0 references

0 references

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

0 references

Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem

0 references

More results on the convergence of iterative methods for the symmetric linear complementarity problem

0 references

Inexact Newton methods for the nonlinear complementarity problem

0 references

Some continuity properties of polyhedral multifunctions

0 references

Generalized equations and their solutions, part II: Applications to nonlinear programming

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach

0 references

On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm

0 references

Distributed asynchronous optimal routing in data networks

0 references

Distributed asynchronous deterministic and stochastic gradient optimization algorithms

0 references

Minimizing Certain Convex Functions

0 references

A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Global Theory

0 references

full work available at URL

https://doi.org/10.1007/bf02096261

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF02096261

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1312756

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