Optimization Online


Primal interior-point method for large sparse minimax optimization.

Ladislav Luksan (luksan***at***cs.cas.cz)
Ctirad Matonoha (matonoha***at***cs.cas.cz)
Jan Vlcek (vlcek***at***cs.cas.cz)

Abstract: In this paper, we propose an interior-point method for large sparse minimax optimization. After a short introduction, where various barrier terms are discussed, the complete algorithm is introduced and some implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Thus nonconvex problems can be solved successfully. The results of computational experiments given in this paper confirm efficiency and robustness of the proposed method.

Keywords: Unconstrained optimization, large-scale

Category 1: Nonlinear Optimization

Category 2: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Citation: Technical Report No. V941, Institute of Computer Science, AV CR, Prague, October 2005.

Download: [Postscript][PDF]

Entry Submitted: 11/04/2005
Entry Accepted: 11/04/2005
Entry Last Modified: 11/04/2005

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