Skip to content
Research Article Open access CC BY 3.0

An Approximate Sequential Bundle Method for Solving a Convex Nondifferentiable Bilevel Programming Problem

Jie Shen, Li-Ping Pang, Xi-Jun Liang, Zun-Quan Xia

Journal of Advances in Mathematics and Computer Science · pp. 2917–2928 · Published 1 Aug 2014

10.9734/BJMCS/2014/12022

Abstract

By combining two bundle methods, PBMASL (proximal bundle method with approximate subgradient linearizations) and DPLBM (descent proximal level bundle method), we present an approximate sequential bundle algorithm for solving a bilevel programming problem with a nondifferentiable convex objective function and two separable constraints. In the proposed algorithm, the values of the objective function in the constraints and its subgradients are computed approximately, the estimates of the tolerances are not required for convergence proof. The presented results improve and extend the earlier work.

Nonsmooth optimization Bilevel programming problem Bundle method Subgradient Proximal bundle method.

References (14)

  1. 1 Nonlinear Programming [DOI]
  2. 2 Monotone Operators and the Proximal Point Algorithm [DOI]
  3. 3 Convex analysis and minimization algorithms [DOI]
  4. 4 Nonsmooth Approach to Optimization Problems with Equilibrium Constraints [DOI]
  5. 5 A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results [DOI]
  6. 6 New variants of bundle methods [DOI]
  7. 7 Convergence of some algorithms for convex minimization [DOI]
  8. 8 Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities [DOI]
  9. 9 A Proximal Bundle Method with Approximate Subgradient Linearizations [DOI]
  10. 10 Approximations in proximal bundle methods and decomposition of convex programs [DOI]
  11. 11 A Proximal Bundle Method Based on Approximate Subgradients [DOI]
  12. 12 A descent algorithm for nonsmooth convex optimization [DOI]
  13. 13 A descent proximal level bundle method for convex nondifferentiable optimization [DOI]
  14. 14 A descent method with relaxation type step [DOI]

Cited by 0

No indexed citations yet.

Related research

Article metrics

Real usage data collected on this platform.

14

Page views

0

PDF downloads

1

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.