Y. E. NESTEROV and A. S. NEMIROVSKI. Interior Point Polynomial Algorithms in Convex Programming. SIAM Publications. SIAM, Philadelphia, USA, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Small Journal Name, ?, 1--18 (199?) - Solving Euclidean Distance (Correct)
No context found.
Y. E. NESTEROV and A. S. NEMIROVSKI. Interior Point Polynomial Algorithms in Convex Programming. SIAM Publications. SIAM, Philadelphia, USA, 1994.
Unknown - Strengthenedsemidefiniteprogramming.. (Correct)
No context found.
Y.E. NESTEROV and A.S. NEMIROVSKII. Interior Point Polynomial Algorithms in Convex Programming.SIAM Publications. SIAM, Philadelphia, USA, 1994. 12
Semidefinite Programming - Henry Wolkowicz October (Correct)
No context found.
Y.E. NESTEROV and A.S. NEMIROVSKI. Interior Point Polynomial Algorithms in Convex Programming. SIAM Publications. SIAM, Philadelphia, USA, 1994.
Relative Optimization for Blind Deconvolution - Alexander Bronstein Student (2004) (Correct)
No context found.
Y. E. Nesterov and A. S. Nemirovski, Interior-Point Polynomial Algorithms in Convex Programming. SIAM, 1994.
Security of Lattice-Based Data Hiding Against the - Known Message Attack (Correct)
No context found.
Y. Nesterov and A. Nemirovskii, Interior-point polynomial algorithms in convex programming, ser. SIAM Studies in Applied Mathematics. Philadelphia: Society for Industrial and Applied Mathematics, 1994, vol. 13.
Convexity, Classification, and Risk Bounds - Peter Bartlett Bartlett (Correct)
No context found.
Nesterov, Y. and Nemirovskii, A. (1994), Interior-Point Polynomial Algorithms in Convex Programming, SIAM Publications, Philadelphia.
Convexity, Classification, and Risk Bounds - Peter Bartlett Bartlett (Correct)
No context found.
Nesterov, Y. and Nemirovskii, A. (1994), Interior-Point Polynomial Algorithms in Convex Programming, SIAM Publications, Philadelphia.
Unknown - (Correct)
No context found.
Yu. E. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming (SIAM, Philadelphia, PA, 1994).
Ecient Optimal Linear Boosting of A Pair of Classifiers - Victor Boyarshinov Dept (Correct)
No context found.
Y. Nesterov and A. Nemirovsky. Interior Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics, 1994.
Ecient Optimal Linear Boosting of A Pair of Classifiers - Victor Boyarshinov Dept (Correct)
No context found.
Y. Nesterov and A. Nemirovsky. Interior Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics, 1994.
Getting the Best Response for Your Erg - Kirk Pruhs Patchrawat (2004) (Correct)
No context found.
I. Nesterov and Nemirovski. Interior Point polynomial algorithms in convex programming. Society for Industrial and Applied Mathematics, 1994.
Relative Optimization for Blind Deconvolution - Bronstein, Bronstein, Zibulevsky (2004) (Correct)
No context found.
Y. E. Nesterov and A. S. Nemirovski, Interior-Point Polynomial Algorithms in Convex Programming. SIAM, 1994.
Getting the Best Response for Your Erg - Kirk Pruhs Patchrawat (2004) (Correct)
No context found.
I. Nesterov and Nemirovski. Interior Point polynomial algorithms in convex programming. Society for Industrial and Applied Mathematics, 1994.
Maximum Likelihood Detection of a MIMO System Using Second Order.. - Khan (Correct)
No context found.
Y. E. Nesterov and A. S. Nemirovskii, "Interior point polynomial algorithms in convex programming", SIAM studies in Applied Mathematics, SIAM, Philadelphia, PA, 1994. .
Robust Portfolio Selection Problems - Goldfarb, Iyengar (2002) (1 citation) (Correct)
No context found.
Nesterov, Y. and Nemirovski, A. (1993). Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia.
Inverse Conic Programming And Applications - Iyengar, Kang (2003) (Correct)
No context found.
Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, 1993.
Lift-and-Project Cutting Planes for Mixed 0-1 Semidefinite .. - Iyengar, Çezik (2001) (Correct)
No context found.
Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, 1993.
Robust Portfolio Management - Erdogan, Goldfarb, Iyengar (2004) (Correct)
No context found.
Y. Nesterov and A. Nemirovski. Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, 1993.
The Simplex Method for Conic Programming - Goldfarb (2002) (Correct)
No context found.
Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, 1993.
Cut Generation for Mixed 0-1 Quadratically Constrained.. - Iyengar, Çezik (2001) (Correct)
No context found.
Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, 1993.
Robust Convex Quadratically Constrained Programs - Goldfarb, Iyengar (2002) (1 citation) (Correct)
No context found.
Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, 1993.
Approximation algorithms for semidefinite packing.. - Iyengar, Phillips, Stein (2004) (Correct)
No context found.
Yurii Nesterov and Arkadii Nemirovskii. Interior-point polynomial algorithms in convex programming, volume 13 of SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994.
Nonconvex All-Quadratic Global Optimization Problems: Solution.. - Raber (1999) (2 citations) (Correct)
No context found.
J.E. Nesterov and A. Nemirovskii. Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, 1994.
Camera calibration using spheres: A semi-definite programming .. - Agrawal, Davis (2003) (Correct)
No context found.
Y. Nesterov and A. Nemirovski. Interior point polynomial algorithms in convex programming. SIAM publications, Philadelphia, USA, 1994.
Complete camera calibration using spheres: A dual-space approach - Agrawal, Davis (Correct)
No context found.
Y. Nesterov and A. Nemirovski. Interior point polynomial algorithms in convex programming. SIAM publications, Philadelphia, USA, 1994.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC