- Some Applications of Symmetric Cone Programming in Financial Mathematics
- A NEW TRIANGULATION FOR SIMPLICIAL ALGORITHMS \Lambda
- Strengthened Existence and Uniqueness Conditions for Search Directions in Semide nite Programming
- A PSEUDO{POLYNOMIAL COMPLEXITY ANALYSIS FOR INTERIOR{POINT
- Monotonicity of Lowner Operators and Its Applications to Symmetric Cone
- The Stable Set Problem and the Lift-and-Project Ranks of Graphs
- STRONG DUALITY FOR SEMIDEFINITE PROGRAMMING # MOTAKURI V. RAMANA + , LEVENT TUNCEL # , AND HENRY WOLKOWICZ #
- \CONE-FREE" PRIMAL-DUAL PATH-FOLLOWING AND POTENTIAL-REDUCTION POLYNOMIAL TIME INTERIOR-POINT METHODS
- CORE DISCUSSION PAPER Local Quadratic Convergence of
- The Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras
- Maximum Utility Product Pricing Models and Algorithms Based on Reservation Prices
- Maximum Utility Product Pricing Models and Algorithms Based on Reservation Prices
- Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
- Applications of Deterministic Optimization Techniques to some Probabilistic Choice Models for
- VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
- Large Scale Portfolio Optimization with Piecewise Linear Transaction Costs
- LEHMAN MATRICES GERARD CORNUEJOLS, BERTRAND GUENIN, LEVENT TUNC EL
- Invariance and Efficiency of Convex Representations Chek Beng Chua
- A NEW TRIANGULATION FOR SIMPLICIAL Michael J. Toddy Levent Tuncelz
- MONOTONICITY OF PRIMAL AND DUAL OBJECTIVE VALUES IN PRIMAL-DUAL INTERIOR-POINT ALGORITHMS
- STRONG DUALITY FOR SEMIDEFINITE PROGRAMMING MOTAKURI V. RAMANA, LEVENT TUNCEL, AND HENRY WOLKOWICZ
- CONES OF MATRICES AND SUCCESSIVE CONVEX RELAXATIONS OF NONCONVEX SETS
- An improved interior-point approach for use in reservoir operation Abbas Seifi
- Complexity Analyses of Discretized Successive Convex Relaxation Methods
- Unification of lowerbound analyses of the liftandproject rank of combinatorial optimization
- MONOTONICITY OF PRIMAL AND DUAL OBJECTIVE VALUES IN PRIMALDUAL INTERIORPOINT ALGORITHMS \Lambda
- An improved interiorpoint approach for use in reservoir operation Abbas Seif i
- CONES OF MATRICES AND SUCCESSIVE CONVEX RELAXATIONS OF NONCONVEX SETS #
- ON THE LIMITING PROPERTIES AFFINE-SCALING DIRECTIONS
- International Conference on Business, Economics and Management, Yasar University, Izmir Turkey
- MIN-MAX THEOREMS RELATED TO GEOMETRIC REPRESENTATIONS OF GRAPHS AND THEIR SDPS
- Lift-and-Project Ranks and Antiblocker Duality L aszl o Lipt ak Levent Tun cel y
- Strong Duality and Minimal Representations for Cone Optimization
- Reconciliation of Various Complexity and Condition Measures for Linear Programming Problems and a
- Clarke Generalized Jacobian of the Projection onto Symmetric Cones
- A PSEUDO--POLYNOMIAL COMPLEXITY ANALYSIS FOR INTERIOR--POINT
- Geometry of Homogeneous Convex Cones, Duality Mapping, and Optimal Self-Concordant Barriers
- Homogeneous Cone Complementarity Problems and P Properties Lingchen Kong, Levent Tuncel, and Naihua Xiu
- Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
- Complexity Analyses of Discretized Successive Convex Relaxation Methods
- Some Applications of Semidefinite Optimization from an Operations Research Viewpoint
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization
- Clarke Generalized Jacobian of the Projection onto Symmetric Cones and Its Applications
- Condition and Complexity Measures for Infeasibility Certi cates of Systems of Linear Inequalities and
- On the Polyhedral Lift-and-Project Methods and the Fractional Stable Set Polytope
- SUFFICIENT CONDITIONS FOR LOW-RANK MATRIX RECOVERY, TRANSLATED FROM
- arXiv:1010.6036v3[math.OC]25Jan2012 OPTIMIZATION PROBLEMS OVER
