Finding a strict feasible solution of a linear semidefinite program (Q632881): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/j.amc.2010.12.083 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038450146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical feasible interior point method for linear semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified algorithm for the strict feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analytic Center Cutting Plane Method with Semidefinite Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:33, 3 July 2024

scientific article
Language Label Description Also known as
English
Finding a strict feasible solution of a linear semidefinite program
scientific article

    Statements

    Finding a strict feasible solution of a linear semidefinite program (English)
    0 references
    0 references
    0 references
    28 March 2011
    0 references
    linear programming
    0 references
    semidefinite programming
    0 references
    projective interior point method
    0 references
    numerical experiments
    0 references

    Identifiers

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