An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939308843884 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017397317 / rank
 
Normal rank

Revision as of 19:24, 19 March 2024

scientific article
Language Label Description Also known as
English
An unconstrained convex programming approach to solving convex quadratic programming problems
scientific article

    Statements

    An unconstrained convex programming approach to solving convex quadratic programming problems (English)
    0 references
    0 references
    0 references
    0 references
    21 August 1995
    0 references
    convex analysis
    0 references
    unconstrained convex programming
    0 references
    convex quadratic programming
    0 references
    \(\varepsilon\)-optimal solution
    0 references

    Identifiers

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