Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPLR / rank
 
Normal rank
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.1007/s10898-008-9328-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002930568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems of distance geometry and convex properties of quadratic maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local minima and convergence in low-rank semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for global optimality. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: First- and second-order methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:14, 1 July 2024

scientific article
Language Label Description Also known as
English
Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
scientific article

    Statements

    Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2009
    0 references
    semidefinite programming
    0 references
    low-rank factorization
    0 references
    optimality conditions
    0 references

    Identifiers