Solution of projection problems over polytopes (Q1185491): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solution of nonsymmetric, linear complementarity problems by iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualität und Approximation bei konvexen Optimierungsproblemen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum norm problems over transportation polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Goldstein-Levitin-Polyak gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of some quadratic programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected gradient methods for linearly constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lagrangean relaxation algorithm for the constrained matrix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for finding saddle points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of projected gradient processes to singular critical points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected Newton method for minimization problems with nonlinear inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Quadratic Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerically stable methods for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically stable dual method for solving strictly convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of projections for finding the common point of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3984058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simultaneous Iterative Method for Computing Projections on Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Hildreth’s Row-Action Method for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of symmetric linear complementarity problems by iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Method for Quadratic Programming / rank
 
Normal rank

Latest revision as of 17:24, 15 May 2024

scientific article
Language Label Description Also known as
English
Solution of projection problems over polytopes
scientific article

    Statements

    Solution of projection problems over polytopes (English)
    0 references
    28 June 1992
    0 references
    This paper is concerned with solving a minimum distance problem subject to linear equality constraints and bounds on the variables. Various projection algorithms, suitable for large-scale problems, are proposed. Linear convergence is established and numerical results are reported.
    0 references
    minimum norm problem
    0 references
    network polytopes
    0 references
    minimum distance problem
    0 references
    projection algorithms
    0 references
    large-scale problems
    0 references
    Linear convergence
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references