An interior-point method for the single-facility location problem with mixed norms using a conic formulation (Q999133): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2161272973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized goal programming: polynomial methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving strong duality for geometric optimization using a conic formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic formulation for \(l_p\)-norm optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of a Practical Interior-Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods: An old and new approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Minimizing a Sum of <i>p</i>-Norms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:17, 29 June 2024

scientific article
Language Label Description Also known as
English
An interior-point method for the single-facility location problem with mixed norms using a conic formulation
scientific article

    Statements

    An interior-point method for the single-facility location problem with mixed norms using a conic formulation (English)
    0 references
    0 references
    0 references
    30 January 2009
    0 references
    0 references
    Nonsymmetric conic optimization
    0 references
    Conic reformulation
    0 references
    Sum of norm minimization
    0 references
    Single-facility location problems
    0 references
    Interior-point methods
    0 references
    0 references