Optimization Online


An inexact proximal bundle method with applications to convex conic programming

Chek Beng Chua (cbchua***at***ntu.edu.sg)
Huiling LIN(linhuiling380***at***hotmail.com)

Abstract: We present an inexact bundle method for minimizing an unconstrained convex sup-function with an open domain. Under some mild assumptions, we reformulate a convex conic programming problem as such problem in terms of the support function. This method is a first-order method, hence it requires much less computational cost in each iteration than second-order approaches such as interior-point methods. While sometimes providing solutions of low accuracy, such method can attack large scale problems. We show the global convergence of this method. Finally, we give an explicit model for the objective function and a concrete routine to compute the largest eigenvalue inexactly in the case of convex quadratic symmetric cone programming.

Keywords: inexact bundle method, convex conic programming, quadratic symmetric cone programming, approximate subgradients, error bound

Category 1: Convex and Nonsmooth Optimization

Category 2: Global Optimization

Citation: Nanyang Technological University, Singapore; Fujian Normal University, PR China 03/2013

Download: [PDF]

Entry Submitted: 04/18/2013
Entry Accepted: 04/18/2013
Entry Last Modified: 04/18/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society