The radar method: An effective line search for piecewise linear concave functions

DOI10.1007/s10479-008-0415-1zbMath1163.90526OpenAlexW2164174335MaRDI QIDQ1026577

Cesar Beltran-Royo

Publication date: 25 June 2009

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10115/5812

zbMATH Keywords

line searchgolden section methodkelley cutting plane methodnext-break-point methodpiecewise linear concave functionradar method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Search theory (90B40)

Related Items (3)

A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization ⋮ Stochastic dual dynamic programming applied to nonconvex hydrothermal models ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
• A projection method for the uncapacitated facility location problem
• Nondifferentiable optimization and polynomial problems
• The gradient projection method with exact line search
• An effective line search for the subgradient method
• Lagrangean relaxation. (With comments and rejoinder).
• An outer approximate subdifferential method for piecewise affine optimization
• The Cutting-Plane Method for Solving Convex Programs

This page was built for publication: The radar method: An effective line search for piecewise linear concave functions