Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization (Q463723): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/mp/JeyakumarL14, #quickstatements; #temporary_batch_1731475607626
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Second-Order-Cone Constraints for Extended Trust-Region Subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear optimization under general norms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the mapping of quadratic forms / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/JeyakumarL14 / rank
 
Normal rank

Latest revision as of 06:33, 13 November 2024

scientific article
Language Label Description Also known as
English
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
scientific article

    Statements

    Identifiers

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