Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Concavity cuts for disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetrical linear maxmin approach to disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power and limitations of affine policies in two-stage adaptive optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liability Concentration and Systemic Losses in Financial Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating convergence of cutting plane algorithms for disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systemic Risk in Financial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust location transportation problems under uncertain demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of \(L _{p }\) minimization / 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: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variable-Complexity Norm Maximization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving two-stage robust optimization problems using a column-and-constraint generation method / rank
 
Normal rank

Latest revision as of 00:57, 26 July 2024

scientific article; zbMATH DE number 7362310
Language Label Description Also known as
English
Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
scientific article; zbMATH DE number 7362310

    Statements

    Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2021
    0 references
    worst-case linear optimization
    0 references
    successive convex optimization
    0 references
    convex relaxation
    0 references
    branch-and-bound
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers