Keywords
Regular polygonComputer scienceMathematicsGeometry
Affiliated Institutions
Related Publications
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widesprea...
Interior-Point Polynomial Algorithms in Convex Programming
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynom...
PENNON: A code for convex nonlinear and semidefinite programming
Abstract We introduce a computer program PENNON for the solution of problems of convex Nonlinear and Semidefinite Programming (NLP-SDP). The algorithm used in PENNON is a genera...
Online convex programming and generalized infinitesimal gradient ascent
Convex programming involves a convex set F ⊆ R n and a convex function c: F → R. The goal of convex programming is to find a point in F which minimizes c. In this paper, we intr...
Convex Optimization
Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subject, this book shows in detail how such problems can be solved nu...
Publication Info
- Year
- 2004
- Type
- book
- Citations
- 2570
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2570
OpenAlex
Cite This
Yurii Nesterov
(2004).
Introductory Lectures on Convex Optimization.
Applied optimization
.
https://doi.org/10.1007/978-1-4419-8853-9
Identifiers
- DOI
- 10.1007/978-1-4419-8853-9