Libros sobre el tema "Programming (Mathematics) Convex programming"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores mejores libros para su investigación sobre el tema "Programming (Mathematics) Convex programming".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore libros sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Neil, Cameron. Introduction to linear and convex programming. Cambridge University Press, 1985.
Buscar texto completoȘandru, Ovidiu-Ilie. Noneuclidean convexity: Applications in the programming theory. Editura Tehnică, 1998.
Buscar texto completoHiriart-Urruty, Jean-Baptiste. Fundamentals of convex analysis. Springer, 2001.
Buscar texto completo1944-, Lemaréchal Claude, ed. Fundamentals of convex analysis. Springer, 2001.
Buscar texto completoXiaoqi, Yang, ed. Lagrange-type functions in constrained non-convex optimization. Kluwer Academic Publishers, 2003.
Buscar texto completoGao, David Yang. Duality principles in nonconvex systems: Theory, methods, and applications. Kluwer Academic Publishers, 2000.
Buscar texto completoHiriart-Urruty, Jean-Baptiste. Convex analysis and minimization algorithms. 2nd ed. Springer-Verlag, 1996.
Buscar texto completoHiriart-Urruty, Jean-Baptiste. Convex analysis and minimization algorithms. Springer-Verlag, 1993.
Buscar texto completoJoaquim António dos Santos Gromicho. Quasiconvex optimization and location theory. Kluwer, 1997.
Buscar texto completoJoaquim António dos Santos Gromicho. Quasiconvex optimization and location theory. Thesis Publishers, 1995.
Buscar texto completoRubinov, Aleksandr Moiseevich. Abstract convexity and global optimization. Kluwer Academic Publishers, 2000.
Buscar texto completoA, Krysov I͡U︡, ред. Sovmestnoe agregirovanie v parametricheskikh zadachakh vypuklogo programmirovanii͡a︡ i mnogokriterialʹnoĭ optimizat͡s︡ii. Vychislitelʹnyĭ t͡s︡entr AN SSSR, 1985.
Buscar texto completo1929-, Ponstein Jacob, ed. Convexity and duality in optimization: Proceedings of the Symposium on Convexity and Duality in Optimization held at the University of Groningen, the Netherlands, June 22, 1984. Springer-Verlag, 1985.
Buscar texto completoRenegar, James. A mathematical view of interior-point methods in convex optimization. Society for Industrial and Applied Mathematics, 2001.
Buscar texto completoNanda, Sudarsan. Two applications of functional analysis. Queen's University, 1986.
Buscar texto completoN, Iusem Alfredo, ed. Totally convex functions for fixed points computation and infinite dimensional optimization. Kluwer Academic Publishers, 2000.
Buscar texto completoInternational Workshop on "Generalized Concavity, Fractional Programming, and Economic Applications" (1988 University of Pisa). Generalized convexity and fractional programming with economic applications: Proceedings of the International Workshop on "Generalized Concavity, Fractional Programming, and Economic Applications" held at the University of Pisa, Italy, May 30-June 1, 1988. Springer-Verlag, 1990.
Buscar texto completoKomlósi, S. Second order conditions of generalized convexity and local optimality in nonlinear programming: The quasi-Hessian approach. Janus Pannonius Tudományegyetem, 1985.
Buscar texto completoNanda, Sudarsan. Two applications of functional analysis. Queen's University, 1986.
Buscar texto completoBarbu, Viorel. Convexity and optimization in Banach spaces. 2nd ed. Editura Academiei, 1986.
Buscar texto completo1941-, Precupanu Theodor, ed. Convexity and optimization in banach spaces. 4th ed. Springer, 2012.
Buscar texto completoBolti͡anskiĭ, V. G. Geometric methods and optimization problems. Kluwer Academic Publishers, 1999.
Buscar texto completoM, Teboulle, ed. Asymptotic cones and functions in optimization and variational inequalities. Springer, 2003.
Buscar texto completoLiana, Lupșa, ed. Non-connected convexities and applications. Kluwer Academic Publishers, 2002.
Buscar texto completoIntroduction to linear and convex programming. Cambridge University Press, 1985.
Buscar texto completoSeparable programming: Theory and methods. Kluwer Academic Publishers, 2001.
Buscar texto completoLitvinov, G. L. (Grigoriĭ Lazarevich), 1944- editor of compilation and Sergeev, S. N., 1981- editor of compilation, eds. Tropical and idempotent mathematics and applications: International Workshop on Tropical and Idempotent Mathematics, August 26-31, 2012, Independent University, Moscow, Russia. American Mathematical Society, 2014.
Buscar texto completoMcCormick, Garth P. Limits of SUMT trajectories in convex programming. U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1997.
Buscar texto completoSemenovich, Nemirovskiĭ Arkadiĭ, ed. Interior-point polynomial algorithms in convex programming. Society for Industrial and Applied Mathematics, 1994.
Buscar texto completoSemenovich, Nemirovskiĭ Arkadiĭ, ed. Self-concordant functions and polynomial-time methods in convex programming. USSR Academy of Sciences, Central Economic & Mathematic Institute, 1989.
Buscar texto completoPolyhedral and semidefinite programming methods in combinatorial optimization. American Mathematical Society, 2010.
Buscar texto completoGould, N. I. M. Numerical methods for large-scale non-convex quadratic programming. Rutherford Appleton Laboratory, 2001.
Buscar texto completoden Hertog, D. Interior Point Approach to Linear, Quadratic and Convex Programming. Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1134-8.
Texto completo