v2007.09.17 - Convex Optimization

BIBLIOGRAPHY 707[178] Vladimir L. Levin. Quasi-convex functions and quasi-monotoneoperators. Journal of Convex Analysis, 2(1/2):167–172, 1995.[179] Adrian S. Lewis. Eigenvalue-constrained faces. Linear Algebra and itsApplications, 269:159–181, 1998.[180] Anhua Lin. Projection algorithms in nonlinear programming. PhDthesis, Johns Hopkins University, 2003.[181] Miguel Sousa Lobo, Lieven Vandenberghe, Stephen Boyd, and HervéLebret. Applications of second-order cone programming. LinearAlgebra and its Applications, 284:193–228, November 1998. SpecialIssue on Linear Algebra in Control, Signals and Image Processing.http://www.stanford.edu/∼boyd/socp.html[182] David G. Luenberger. Optimization by Vector Space Methods. Wiley,1969.[183] David G. Luenberger. Introduction to Dynamic Systems: Theory,Models, & Applications. Wiley, 1979.[184] David G. Luenberger. Linear and Nonlinear Programming.Addison-Wesley, second edition, 1989.[185] Zhi-Quan Luo, Jos F. Sturm, and Shuzhong Zhang. Superlinearconvergence of a symmetric primal-dual path following algorithm forsemidefinite programming. SIAM Journal on Optimization, 8(1):59–81,1998.[186] Zhi-Quan Luo and Wei Yu. An introduction to convex optimizationfor communications and signal processing. IEEE Journal On SelectedAreas In Communications, 24(8):1426–1438, August 2006.[187] K. V. Mardia. Some properties of classical multi-dimensionalscaling. Communications in Statistics: Theory and Methods,A7(13):1233–1241, 1978.[188] K. V. Mardia, J. T. Kent, and J. M. Bibby. Multivariate Analysis.Academic Press, 1979.[189] Jerrold E. Marsden and Michael J. Hoffman. Elementary ClassicalAnalysis. Freeman, second edition, 1995.