Keywords
Regular polygonComputer scienceMathematicsGeometry
Affiliated Institutions
Related Publications
An algorithm for constructing the aspect graph
In this paper we present tight bounds on the maximum size of aspect graphs and give worstcase optimal algorithms for their construction, first in the convex case and then in the...
Reentrant polygon clipping
A new family of clipping algorithms is described. These algorithms are able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts...
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
The adoption of a Reconfigurable Intelligent Surface (RIS) for downlink multi-user communication from a multi-antenna base station is investigated in this paper. We develop ener...
Swarms on Sphere: A Programmable Swarm with Synchronous Behaviors like Oscillator Networks
In this paper, we introduce a programmable particle swarm evolving on a sphere called swarm on sphere system. This model is a polynomial dynamical system obtained from a consens...
Regularization Paths for Generalized Linear Models via Coordinate Descent
We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, two-class logistic regression, and multi- nom...
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