Convex quadratic programming with one constraint and bounded variables (Q3771973): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3949869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone solutions of the parametric linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially bounded algorithm for a singly constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New and Efficient Algorithm for a Class of Portfolio Selection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02591992 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965159235 / rank
 
Normal rank

Latest revision as of 08:28, 30 July 2024

scientific article
Language Label Description Also known as
English
Convex quadratic programming with one constraint and bounded variables
scientific article

    Statements

    Convex quadratic programming with one constraint and bounded variables (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    projection
    0 references
    separable program
    0 references
    convex quadratic problem
    0 references
    linear equality constraint
    0 references
    bounded variables
    0 references
    exact line search
    0 references
    unit step-size
    0 references

    Identifiers