The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

  
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2004  
         
  Article:   INFEASIBLE PRIMAL-DUAL ALGORITHM FOR MINIMIZING CONVEX QUADRATIC PROBLEMS.

Authors:  H. ROUMILI, A. KERAGHEL, A. YASSINE. 		 
       
         
  Abstract:  Problems with a convex quadratic objective function and lin- ear constraints are important in their own right, and they also arise as sub problems in Methods for general constrained optimization, such as sequential quadratic Programming and augmented Lagrangian methods. In this paper, we propose and implement an infeasible primal-dual algo- rithm in order to minimize a convex quadratic function subject to bounded and linear equality constraints. Preliminary experimentations are particularly encouraging.  
         
     
         
         
      Back to previous page