Polyhedral approximations in<i>p</i>-order cone programming (Q2926080): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q405679
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pavlo A. Krokhmal / 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.1080/10556788.2013.877905 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047426468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherent Measures of Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic mixed-integer rounding cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting for conic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polyhedral Approximations of the Second-Order Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for mixed 0-1 conic programming / 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: Higher moment coherent risk measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Risk optimization with \(p\)-order conic constraints: a linear programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration-complexity of first-order penalty methods for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(p\)-norm linear discrimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards non-symmetric conic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\ell_ p\) programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Minimizing a Sum of <i>p</i>-Norms / rank
 
Normal rank

Latest revision as of 06:10, 9 July 2024

scientific article
Language Label Description Also known as
English
Polyhedral approximations in<i>p</i>-order cone programming
scientific article

    Statements

    Polyhedral approximations in<i>p</i>-order cone programming (English)
    0 references
    0 references
    0 references
    29 October 2014
    0 references
    0 references
    \(p\)-order cone programming
    0 references
    second-order cone programming
    0 references
    polyhedral approximation
    0 references
    cutting-plane methods
    0 references
    mixed-integer \(p\)-order cone programming
    0 references
    stochastic programming
    0 references
    portfolio optimization
    0 references
    0 references