VinhUni
Home
Message
Scientists
Articles
Projects
Textbooks
News
Dashboard
Tiếng việt
Bài báo khoa học
Home
Bài báo khoa học
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:
480
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 problem
Coderivative Characterizations of Maximal Monotonicity for Set-Valued Mappings
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
Computation of graphical derivative for a class of normal cone mappings under a very weak condition
Second-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 approximation
SOS-Convex Semialgebraic Programs and its Applications to Robust Optimization: A Tractable Class of Nonsmooth Convex Optimization
Convexity of sets and functions via second-order subdifferentials
Tilt stability for quadratic programs with one or two quadratic inequality constraints
Quadratic growth and strong metric subregularity of the subdifferential via subgradient graphical derivative
Quadratic Growth and Strong Metric Subregularity of the Subdifferential for a Class of Non-prox-regular Functions