Keywords
SubderivativeMathematicsConvex analysisDuality (order theory)BundleDescent (aeronautics)Regular polygonMinificationAlgorithmConvex functionAccelerationConvex optimizationMathematical optimizationCombinatoricsGeometryEngineeringPhysics
Related Publications
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...
ROBUST MODELING WITH ERRATIC DATA
An attractive alternative to least‐squares data modeling techniques is the use of absolute value error criteria. Unlike the least‐squares techniques the inclusion of some infini...
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...
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
This paper proves best known guarantees for exact reconstruction of a sparse signal f from few non-adaptive universal linear measurements. We consider Fourier measurements (rand...
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...
Publication Info
- Year
- 1993
- Type
- book
- Citations
- 2435
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2435
OpenAlex
Cite This
Jean‐Baptiste Hiriart‐Urruty,
Claude Lemaréchal
(1993).
Convex analysis and minimization algorithms.
.
https://doi.org/10.1007/978-3-662-02796-7
Identifiers
- DOI
- 10.1007/978-3-662-02796-7