Solution of projection problems over polytopes

DOI10.1007/BF01385498zbMath0758.65046MaRDI QIDQ1185491

Bing-sheng He, Josef Stoer

Publication date: 28 June 1992

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133611

zbMATH Keywords

numerical resultslarge-scale problemsminimum norm problemprojection algorithmsLinear convergenceminimum distance problemnetwork polytopes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Some recent advances in projection-type methods for variational inequalities ⋮ On the closest point to the origin in transportation polytopes ⋮ A class of iterative methods for solving nonlinear projection equations ⋮ Solving linear variational inequality problems by a self-adaptive projection method ⋮ A new extragradient-like method for solving variational inequality problems ⋮ Iterative solution of convex problems by fejer-monotone methods ⋮ The iterative methods for monotone generalized variational inequalities ⋮ A new class of projection and contraction methods for solving variational inequality problems ⋮ Local convergence behavior of some projection-type methods for affine variational inequalities ⋮ Modified fixed-point equations and related iterative methods for variational inequalities ⋮ Local convergence analysis of projection-type algorithms: unified approach ⋮ Extended projection methods for monotone variational inequalities ⋮ An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) ⋮ On a class of iterative projection and contraction methods for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• A projected Newton method for minimization problems with nonlinear inequality constraints
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• Minimum norm problems over transportation polytopes
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• Solution of symmetric linear complementarity problems by iterative methods
• On the convergence of projected gradient processes to singular critical points
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• Complementary pivot theory of mathematical programming
• The Simplex Method for Quadratic Programming
• Equivalence of some quadratic programming algorithms
• A lagrangean relaxation algorithm for the constrained matrix problem
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• Projected gradient methods for linearly constrained problems
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
• On the Goldstein-Levitin-Polyak gradient projection method
• Numerically stable methods for quadratic programming
• Dualität und Approximation bei konvexen Optimierungsproblemen
• Numerical methods for finding saddle points
• Convex programming in Hilbert space
• The method of projections for finding the common point of convex sets
• A General Quadratic Programming Algorithm