The following pages link to Fatma Kılınç-Karzan (Q312704):
Displayed 32 items.
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- (Q633106) (redirect page) (← links)
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions (Q633107) (← links)
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals (Q741817) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
- Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity (Q2097654) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
- Exploiting problem structure in optimization under uncertainty via online convex optimization (Q2316616) (← links)
- On intersection of two mixing sets with applications to joint chance-constrained programs (Q2414899) (← links)
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization (Q2434980) (← links)
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures (Q2437335) (← links)
- An online convex optimization-based framework for convex bilevel optimization (Q2693650) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing (Q3112405) (← links)
- The tool transporter movements problem in flexible manufacturing systems (Q3498887) (← links)
- Technical Note—Dynamic Data-Driven Estimation of Nonparametric Choice Models (Q5031619) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- Two-Term Disjunctions on the Second-Order Cone (Q5419008) (← links)
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)
- Necessary and Sufficient Conditions for Rank-One-Generated Cones (Q6199234) (← links)
- Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty under Wasserstein Ambiguity (Q6345024) (← links)
- A Geometric View of SDP Exactness in QCQPs and its Applications (Q6353715) (← links)
- Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications (Q6357156) (← links)
- Exactness in SDP relaxations of QCQPs: Theory and applications (Q6372833) (← links)