page loader
  1. Home
  2. Bài báo khoa học
  3. Chi tiết bài báo
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
Authors:
492    0
Operations Research Letters 47 (6), 530-536
:     :
: https://www.sciencedirect.com/science/article/abs/pii/S0167637718306278
Publishing year: 2019
Further results on subgradients of the value function to a parametric optimal control problemCoderivative Characterizations of Maximal Monotonicity for Set-Valued MappingsA convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problemsComputation of graphical derivative for a class of normal cone mappings under a very weak conditionSecond-order subdifferentials and optimality conditions for C1-smooth optimization problems.Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximationSOS-Convex Semialgebraic Programs and its Applications to Robust Optimization: A Tractable Class of Nonsmooth Convex OptimizationConvexity of sets and functions via second-order subdifferentialsTilt stability for quadratic programs with one or two quadratic inequality constraintsQuadratic growth and strong metric subregularity of the subdifferential via subgradient graphical derivativeQuadratic Growth and Strong Metric Subregularity of the Subdifferential for a Class of Non-prox-regular Functions