An illumination problem: optimal apex and optimal orientation for a cone of light
From MaRDI portal
Publication:2250115
DOI10.1007/s10898-013-0071-0zbMath1317.90241OpenAlexW1978398925WikidataQ62473088 ScholiaQ62473088MaRDI QIDQ2250115
Manlio Gaudioso, Annabella Astorino, Alberto Seeger
Publication date: 4 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0071-0
Related Items
An illumination problem with tradeoff between coverage of a dataset and aperture angle of a conic light beam, Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach, On highly eccentric cones, Lipschitz and Hölder continuity results for some functions of cones
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DC models for spherical separation
- Inradius and circumradius of various convex cones arising in applications
- On properties of different notions of centers for convex cones
- Some aperture-angle optimization problems
- Aperture-angle optimization problems in three dimensions
- Solidity indices for convex cones
- Margin maximization in spherical separation
- Normality and modulability indices. I: Convex cones in normed spaces
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Condition number and eccentricity of a closed convex cone
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Generalized Gradients and Applications
- Finding the nearest point in A polytope
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A Simple Norm Inequality
- Aperture-angle and Hausdorff-approximation of convex figures
- Set-valued analysis
