Optimizing sensor cover energy via DC programming

DOI10.1007/s11590-014-0778-yzbMath1343.90064WikidataQ62473082 ScholiaQ62473082MaRDI QIDQ5963236

Giovanna Miglionico, Annabella Astorino

Publication date: 4 March 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0778-y

zbMATH Keywords

DC programming; non-smooth optimization; wireless sensor networks

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C26: Nonconvex programming, global optimization

Related Items

Approximation by Delta-Convex Mappings in Certain Spaces, Preface to the special issue ``Recent developments in non-linear and global optimization, Essentials of numerical nonsmooth optimization, Essentials of numerical nonsmooth optimization, A Lagrangean relaxation approach to lifetime maximization of directional sensor networks, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, Monotonic optimization for sensor cover energy problem, Classification in the multiple instance learning framework via spherical separation, Sequential difference-of-convex programming, Proximal bundle methods for nonsmooth DC programming

Cites Work

• Maximizing system lifetime in wireless sensor networks
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• Non-Linear Programming Via Penalty Functions
• Unnamed Item