-

 

 

 




Optimization Online





 

An interior-point method for minimizing the sum of piecewise-linear convex functions

Toshihiro Kosaki(kosaki.t.aa***at***m.titech.ac.jp)

Abstract: We consider the problem to minimize the sum of piecewise-linear convex functions under both linear and nonnegative constraints. We convert the piecewise-linear convex problem into a standard form linear programming problem (LP) and apply a primal-dual interior-point method for the LP. From the solution of the converted problem, we can obtain the solution of the original problem. We establish polynomial convergence of the interior-point method for the converted problem and devise the computaion of the Newton direction.

Keywords: optimization, piecewise-linear convex function, interior-point method

Category 1: Nonlinear Optimization

Citation: The Department of Industrial and Management Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152-8552 Japan

Download: [PDF]

Entry Submitted: 02/26/2010
Entry Accepted: 02/26/2010
Entry Last Modified: 02/26/2010

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
Mathematical Programming Society