An illumination problem with tradeoff between coverage of a dataset and aperture angle of a conic light beam
From MaRDI portal
Publication:2358064
DOI10.1007/s11081-015-9293-yzbMath1364.90267OpenAlexW2199532640WikidataQ62473071 ScholiaQ62473071MaRDI QIDQ2358064
Manlio Gaudioso, Alberto Seeger, Annabella Astorino
Publication date: 21 June 2017
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-015-9293-y
Convex programming (90C25) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Markov and semi-Markov decision processes (90C40)
Cites Work
- Unnamed Item
- Some aperture-angle optimization problems
- Aperture-angle optimization problems in three dimensions
- An illumination problem: optimal apex and optimal orientation for a cone of light
- Central axes and peripheral points in high dimensional directional datasets
- Directional derivative of a minimax function
- Generalized Gradients and Applications
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- The Theory of Max-Min, with Applications
- A Simple Norm Inequality
This page was built for publication: An illumination problem with tradeoff between coverage of a dataset and aperture angle of a conic light beam
