Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(95)00199-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017362419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Optimal Locally Constrained Steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Nonlinear Programming: A Simplified Applications-Oriented Development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization by Quadratic Hill-Climbing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with an interior point algorithm on the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point algorithm to solve computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing by spline functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing by spline functions. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to obtaining global extremums in polynomial mathematical programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton’s Method with a Model Trust Region Modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On affine scaling algorithms for nonconvex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a subproblem of trust region algorithms for constrained optimization / rank
 
Normal rank

Latest revision as of 17:31, 28 May 2024

scientific article
Language Label Description Also known as
English
Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
scientific article

    Statements

    Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (English)
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    duality
    0 references
    nonconvex programming
    0 references
    quadratic programming
    0 references
    sensitivity analysis
    0 references
    trust region subproblem
    0 references
    nonconvex quadratic function
    0 references

    Identifiers

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