SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11228-017-0456-1 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A Complete Characterization of the Gap between Convexity and SOS-Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Frank--Wolfe type theorem for convex polynomial programs / 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: Q4210476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3654591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / 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 SOS-convex polynomial optimization problems: exact SDP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying approach to robust convex infinite optimization duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear semi-infinite programming duality under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust convex quadratically constrained programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Robust Convex Programming: Complete Characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of alternative theorems for SOS-convex inequalities and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact SDP relaxations for classes of nonlinear semidefinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual semidefinite programs without duality gaps for a class of convex minimax programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in SemiAlgebraic Geometry and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and genericity for semi-algebraic compact programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust conjugate duality for convex optimization under uncertainty with application to data classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization and Variable Selection Via the Elastic Net / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11228-017-0456-1 / rank
 
Normal rank

Latest revision as of 01:18, 11 December 2024

scientific article
Language Label Description Also known as
English
SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
scientific article

    Statements

    SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (English)
    0 references
    0 references
    3 August 2018
    0 references
    nonsmooth optimization
    0 references
    convex optimization
    0 references
    SOS-convex polynomial
    0 references
    semidefinite program
    0 references
    robust optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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