Y. Nesterov and A. Nemirovskii, Interior-point polynomial methods in convex programming, SIAM, Philadelphia, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Nesterov-Todd Direction and its Relation to Weighted Analytic .. - Hauser Self-citation (Nesterov) (Correct)
No context found.
Yu. E. Nesterov and A. S. Nemirovskii. Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. SIAM Publications. SIAM, Philadelphia, USA, 1994.
A k-Partition, Graph Theoretic Approach to.. - Byrne, Gandhe.. (2003) (Correct)
No context found.
Y. Nesterov and A. Nemirovskii, Interior-point polynomial methods in convex programming, SIAM, Philadelphia, 1994.
Receive Antenna Selection in MIMO Systems using Convex.. - Aditya Dua Kamesh (Correct)
No context found.
Y. Nesterov and A. Nemirovsky, "Interior-point polynomial methods in convex programming", Studies in Applied Mathematics, vol. 13, Philadelphia, PA: SIAM, 1994.
On The Least Squares Approximation Of - Symmetric-Definite Pencils Subject (Correct)
No context found.
Yu. Nesterov and A. Nemirovsky, Interior-point polynomial methods in convex programming, Vol. 13, in Studies in Applied Math., SIAM, Philadelphia, 1994.
OPTIMALITY, COMPUTATION, AND INTERPRETATION OF NONNEGATIVE.. - Chu Diele Plemmons (Correct)
No context found.
Yu. E. Nesterov and A. S. Nemirovsky, Interior Point Polynomial Methods in Convex Programming, SIAM Studies in Applied Mathematics, 13, SIAM, Philadelphia, 1994.
The Educational Testing Problem Revisited - Moody Chu And (Correct)
No context found.
Yu. E. Nesterov and A. S. Nemirovsky, Interior Point Polynomial Methods in Convex Programming: Theory and Applications, SIAM, to be published.
SignalProcdJF;I 83 (2003) 729 -- 743.. - Simultaneous.. (Correct)
No context found.
Y. Nesterov, A. Nemirovsky, Interior Point Polynomial Methods in Convex Programming: Theory andApplic#dAIT6 SIAM, Philadelphia, PA, 1994.
Journal of Machine Learning Research 5 (2004) 27-72.. - Gert Lanckriet Gert (Correct)
No context found.
Nesterov, Y. and Nemirovsky, A. (1994). Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM.
Kernel-based Integration of Genomic Data using Semide - Nite Programming Gert (Correct)
No context found.
Y. Nesterov and A. Nemirovsky. Interior point polynomial methods in convex programming: Theory and applications. SIAM, Philadelphia, PA, 1994.
Bioinformatics - Vol No Pages (Correct)
No context found.
Nesterov,Y. and Nemirovsky,A. (1994) Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia, PA.
Unknown - (Correct)
No context found.
Y. Nesterov and A. Nemirovsky, Interior-Point Polynomial Methods in Convex Programming. Philadelphia, PA: SIAM, 1994.
Optimal QoS Sampling Frequency Assignment for - Real-Time Wireless Sensor (Correct)
No context found.
Y. Nesterov and A. Nemirovsky, Interior Point Polynomial Methods in Convex Programming. SIAM, 1994.
Robust Classification with Interval Data - Ghaoui, al. (2003) (5 citations) (Correct)
No context found.
Yu. Nesterov and A. Nemirovsky. Interior point polynomial methods in convex programming: Theory and applications. SIAM, Philadelphia, PA, 1994.
Receive Antenna Selection in MIMO Systems using Convex.. - Dua, Medepalli, Paulraj (Correct)
No context found.
Y. Nesterov and A. Nemirovsky, "Interior-point polynomial methods in convex programming", Studies in Applied Mathematics, vol. 13, Philadelphia, PA: SIAM, 1994.
Approximate Minimum Enclosing Balls in High Dimensions.. - Kumar, Mitchell.. (2003) (Correct)
No context found.
Y. E. Nesterov and A. S. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM Publications, Philadelphia, 1994.
Computing Core-Sets and Approximate Smallest Enclosing.. - Kumar, Mitchell.. (Correct)
No context found.
Y. E. Nesterov and A. S. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM Publications, Philadelphia, 1994.
Minimum-Volume Enclosing Ellipsoids and Core - Sets Kumar And (Correct)
No context found.
Nesterov, Yu. E., and Nemirovskii, A. S., Interior-Point Polynomial Methods in Convex Programming, SIAM Publications, Philadelphia, Pennsylvania, 1994.
Complete Classification of Self-scaled Barrier Functions - Schmieta (2000) (2 citations) (Correct)
No context found.
Y. Nesterov and A. Nemirovski. Interior Point Polynomial Methods in Convex Programming: Theory and Applications. Society for Industrial and Applied Mathematics, Philadelphia, 1994.
Semidefinite Programming and Combinatorial Optimization - Goemans (Correct)
No context found.
Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM, Philadelphia, PA, 1994.
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
No context found.
Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
Approximating Quadratic Programming With Bound Constraints - Ye (1997) (27 citations) (Correct)
No context found.
Yu. E. Nesterov and A. S. Nemirovskii, Interior Point Polynomial Methods in Convex Programming : Theory and Algorithms (SIAM Publications, SIAM, Philadelphia, 1993).
Minimum Principle of Complementary Energy in Nonlinear.. - Kanno, Ohsaki (2002) (Correct)
No context found.
Yu.E. Nesterov and A.S. Nemirovskii, Interior Point Polynomial Methods in Convex Programming: Theory and Applications, SIAM, Philadelphia, PA, 1994.
Improving Complexity of Structured Convex Optimization Problems.. - Glineur (Correct)
No context found.
Y. E. Nesterov and A. S. Nemirovski, Interior-point polynomial methods in convex programming, SIAM Studies in Applied Mathematics, SIAM Publications, Philadelphia, 1994. 20
Robust Blind Multiuser Detection Against Cdma Signature.. - Shuguang Cui Zhi-Quan (Correct)
No context found.
Yu. Nesterov and A. Nemirovsky, "Interior-point polynomial methods in convex programming," volume 13 of "Studies in Applied mathematics." SIAM, Philadelphia, PA, 1994.
Generalized Chebyshev bounds via semidefinite programming - Lieven Vandenberghe Stephen (Correct)
No context found.
Y. Nesterov and A. Nemirovskii. Interior-Point Polynomial Methods in Convex Programming. Society for Industrial and Applied Mathematics, 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