A nonlinear feasibility condition built from concave envelopes and Brouwer's fixed point theorem yields a sequential convex optimization method with robust feasibility guarantees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sequential Convex Restriction and its Applications in Robust Optimization
A nonlinear feasibility condition built from concave envelopes and Brouwer's fixed point theorem yields a sequential convex optimization method with robust feasibility guarantees.