Books on the topic 'Programming (Mathematics) Convex programming'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic 'Programming (Mathematics) Convex programming.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
Neil, Cameron. Introduction to linear and convex programming. Cambridge University Press, 1985.
Find full textȘandru, Ovidiu-Ilie. Noneuclidean convexity: Applications in the programming theory. Editura Tehnică, 1998.
Find full textXiaoqi, Yang, ed. Lagrange-type functions in constrained non-convex optimization. Kluwer Academic Publishers, 2003.
Find full textGao, David Yang. Duality principles in nonconvex systems: Theory, methods, and applications. Kluwer Academic Publishers, 2000.
Find full textHiriart-Urruty, Jean-Baptiste. Convex analysis and minimization algorithms. 2nd ed. Springer-Verlag, 1996.
Find full textHiriart-Urruty, Jean-Baptiste. Convex analysis and minimization algorithms. Springer-Verlag, 1993.
Find full textJoaquim António dos Santos Gromicho. Quasiconvex optimization and location theory. Kluwer, 1997.
Find full textJoaquim António dos Santos Gromicho. Quasiconvex optimization and location theory. Thesis Publishers, 1995.
Find full textRubinov, Aleksandr Moiseevich. Abstract convexity and global optimization. Kluwer Academic Publishers, 2000.
Find full textA, 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.
Find full text1929-, 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.
Find full textRenegar, James. A mathematical view of interior-point methods in convex optimization. Society for Industrial and Applied Mathematics, 2001.
Find full textNanda, Sudarsan. Two applications of functional analysis. Queen's University, 1986.
Find full textN, Iusem Alfredo, ed. Totally convex functions for fixed points computation and infinite dimensional optimization. Kluwer Academic Publishers, 2000.
Find full textInternational 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.
Find full textKomlósi, S. Second order conditions of generalized convexity and local optimality in nonlinear programming: The quasi-Hessian approach. Janus Pannonius Tudományegyetem, 1985.
Find full textNanda, Sudarsan. Two applications of functional analysis. Queen's University, 1986.
Find full textBarbu, Viorel. Convexity and optimization in Banach spaces. 2nd ed. Editura Academiei, 1986.
Find full text1941-, Precupanu Theodor, ed. Convexity and optimization in banach spaces. 4th ed. Springer, 2012.
Find full textBolti͡anskiĭ, V. G. Geometric methods and optimization problems. Kluwer Academic Publishers, 1999.
Find full textM, Teboulle, ed. Asymptotic cones and functions in optimization and variational inequalities. Springer, 2003.
Find full textLiana, Lupșa, ed. Non-connected convexities and applications. Kluwer Academic Publishers, 2002.
Find full textLitvinov, 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.
Find full textMcCormick, Garth P. Limits of SUMT trajectories in convex programming. U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1997.
Find full textSemenovich, Nemirovskiĭ Arkadiĭ, ed. Interior-point polynomial algorithms in convex programming. Society for Industrial and Applied Mathematics, 1994.
Find full textSemenovich, Nemirovskiĭ Arkadiĭ, ed. Self-concordant functions and polynomial-time methods in convex programming. USSR Academy of Sciences, Central Economic & Mathematic Institute, 1989.
Find full textPolyhedral and semidefinite programming methods in combinatorial optimization. American Mathematical Society, 2010.
Find full textGould, N. I. M. Numerical methods for large-scale non-convex quadratic programming. Rutherford Appleton Laboratory, 2001.
Find full textden 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.
Full text