- | ||||
|
![]()
|
Level Bundle Methods for Constrained Convex Optimization with Various Oracles
Wim van Ackooij (wim.van-ackooij Abstract: We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions are known through oracles (black-boxes) that might provide inexact information. Our approach is general and covers many instances of inexact oracles, such as upper, lower and on-demand oracles. We show that the proposed level bundle methods are convergent as long as the memory is restricted to at least four well chosen linearizations: two linearizations for the objective function, and two linearizations for the constraints. The proposed methods are particularly suitable for both joint chance-constrained problems and two-stage stochastic programs with risk measure constraints. The approach is assessed on realistic joint constrained energy problems, arising when dealing with robust cascaded-reservoir management. Keywords: Nonsmooth Optimization · Stochastic Optimization · Level Bundle Method · Chance Constrained Programming Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization ) Citation: Download: Entry Submitted: 05/23/2013 Modify/Update this entry | ||
Visitors | Authors | More about us | Links | |
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository
|
Submit Update Policies |
Coordinator's Board Classification Scheme Credits Give us feedback |
Optimization Journals, Sites, Societies | |
![]() |