Optimization Online


Numerical Experiments with universal barrier functions for cones of Chebyshev systems

Leonid Faybusovich (leonid.faybusovich.1***at***nd.edu)
Thanasak Moutonglang (thanasak***at***math.science.cmu.ac.th)
Takashi Tsuchiya (tsuchiya***at***sun312.ism.ac.jp)

Abstract: Based on previous explicit computations of universal barrier functions, we describe numerical experiments for solving certain classes of convex optimization problems. The comparison is given of the performance of the classical affine-scaling algorithm with similar algorithm based upon the universal barrier function

Keywords: Affine-scaling algorithm, approximations of universal barrier functions

Category 1: Infinite Dimensional Optimization (Semi-infinite Programming )

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Category 3: Linear, Cone and Semidefinite Programming

Citation: To appear in "Computational Optimization and Applications"

Download: [PDF]

Entry Submitted: 02/23/2006
Entry Accepted: 02/23/2006
Entry Last Modified: 12/12/2006

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