This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Borwein, Jon M. 1981. Characterization of optimality for the abstract convex program with finite dimensional range. Journal of the Australian Mathematical Society, Vol. 30, Issue. 4, p. 390.
Massam, Helene and Muller, Jochen 1985. The nonnegative MINQUE estimate. Journal of Multivariate Analysis, Vol. 16, Issue. 2, p. 253.
Chui, Charles K Deutsch, Frank and Ward, Joseph D 1992. Constrained best approximation in Hilbert space, II. Journal of Approximation Theory, Vol. 71, Issue. 2, p. 213.
Lewis, A. S. 1994. Facial reduction in partially finite convex programming. Mathematical Programming, Vol. 65, Issue. 1-3, p. 123.
Alizadeh, Farid 1995. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. SIAM Journal on Optimization, Vol. 5, Issue. 1, p. 13.
Peyrl, Helfried and Parrilo, Pablo A. 2008. Computing sum of squares decompositions with rational coefficients. Theoretical Computer Science, Vol. 409, Issue. 2, p. 269.
Ding, Yichuan Krislock, Nathan Qian, Jiawei and Wolkowicz, Henry 2008. Sensor network localization, euclidean distance matrix completions, and graph realization. p. 129.
Waki, Hayato and Muramatsu, Masakazu 2010. A facial reduction algorithm for finding sparse SOS representations. Operations Research Letters, Vol. 38, Issue. 5, p. 361.
Zhang, Qinghong Chen, Gang and Zhang, Ting 2010. Self-Dual Embedding for SDP Using ELSD and its Lagrangian Dual. p. 25.
Zhang, Qinghong 2010. Understanding linear semi-infinite programming via linear programming over cones. Optimization, Vol. 59, Issue. 8, p. 1247.
Ding, Yichuan Krislock, Nathan Qian, Jiawei and Wolkowicz, Henry 2010. Sensor Network Localization, Euclidean Distance Matrix completions, and graph realization. Optimization and Engineering, Vol. 11, Issue. 1, p. 45.
Zhang, Qinghong Chen, Gang and Zhang, Ting 2010. Duality formulations in semidefinite programming. Journal of Industrial & Management Optimization, Vol. 6, Issue. 4, p. 881.
Zhang, Qinghong 2011. The minimal cone for conic linear programming. 4OR, Vol. 9, Issue. 4, p. 403.
Waki, Hayato and Muramatsu, Masakazu 2011. AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)). Journal of the Operations Research Society of Japan, Vol. 54, Issue. 4, p. 161.
Hiriart-Urruty, Jean-Baptiste and Malick, Jérôme 2012. A Fresh Variational-Analysis Look at the Positive Semidefinite Matrices World. Journal of Optimization Theory and Applications, Vol. 153, Issue. 3, p. 551.
Zhang, Qinghong 2012. Embedding methods for semidefinite programming. Optimization Methods and Software, Vol. 27, Issue. 3, p. 461.
Tunçel, Levent and Wolkowicz, Henry 2012. Strong duality and minimal representations for cone optimization. Computational Optimization and Applications, Vol. 53, Issue. 2, p. 619.
Waki, Hayato and Muramatsu, Masakazu 2013. Facial Reduction Algorithms for Conic Optimization Problems. Journal of Optimization Theory and Applications, Vol. 158, Issue. 1, p. 188.
Cheung, Yuen-Lam Schurr, Simon and Wolkowicz, Henry 2013. Computational and Analytical Mathematics. Vol. 50, Issue. , p. 251.
Pataki, Gábor 2013. Computational and Analytical Mathematics. Vol. 50, Issue. , p. 613.