TITLE

A NEW NONLINEAR LAGRANGIAN METHOD FOR NONCONVEX SEMIDEFINITE PROGRAMMING

AUTHOR(S)
LI, Y.; ZHANG, L.
PUB. DATE
December 2009
SOURCE
Journal of Applied Analysis;2009, Vol. 15 Issue 2, p149
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
No abstract available.
ACCESSION #
98174471

 

Related Articles

  • CONVERGENCE ANALYSIS OF A NONLINEAR LAGRANGIAN METHOD FOR NONCONVEX SEMIDEFINITE PROGRAMMING WITH SUBPROBLEM INEXACTLY SOLVED. YANG LI; YONGHONG REN; YUN WANG; JIAN GU // Journal of Industrial & Management Optimization;Jan2015, Vol. 11 Issue 1, p65 

    In this paper, we analyze the convergence properties of a nonlinear Lagrangian method based on Log-Sigmoid function for nonconvex semidefinite programming (NCSDP) problems. It is different from other convergence analysis, because the subproblem in our algorithm is inexactly solved. Under the...

  • Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems. Grippo, Luigi; Palagi, Laura; Piccialli, Veronica // Journal of Global Optimization;Jul2009, Vol. 44 Issue 3, p339 

    In this paper we consider the standard linear SDP problem, and its low rank nonlinear programming reformulation, based on a Gramian representation of a positive semidefinite matrix. For this nonconvex quadratic problem with quadratic equality constraints, we give necessary and sufficient...

  • On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming. Luo, H.; Wu, H.; Chen, G. // Journal of Global Optimization;Nov2012, Vol. 54 Issue 3, p599 

    In this paper, we present new convergence properties of the augmented Lagrangian method for nonlinear semidefinite programs (NSDP). Convergence to the approximately global solutions and optimal values of NSDP is first established for a basic augmented Lagrangian scheme under mild conditions,...

  • A self-concordance property for nonconvex semidefinite programming. Garcés, Rodrigo; Gómez, Walter; Jarre, Florian // Mathematical Methods of Operations Research;Aug2011, Vol. 74 Issue 1, p77 

    The paper considers nonconvex quadratic semidefinite problems. This class arises, for instance, as subproblems in the sequential semidefinite programming algorithm for solving general smooth nonlinear semidefinite problems. We extend locally the concept of self-concordance to problems that...

  • Reactive Power Optimization for Distribution Network with Distributed Generators Based on Semi-definite Programming. Lei Dong; Aizhong Tian; Tianjiao Pu; Zheng Fan; Ting Yu // Advanced Materials Research;2014, Vol. 1070-1072, p809 

    Reactive power optimization for distribution network with distributed generators is a complicated nonconvex nonlinear mixed integer programming problem. This paper built a mathematical model of reactive power optimization for distribution network and a new method to solve this problem was...

  • Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming. Wu, Huixian; Luo, Hezhi; Ding, Xiaodong; Chen, Guanting // Computational Optimization & Applications;Dec2013, Vol. 56 Issue 3, p531 

    We investigate in this paper global convergence properties of the augmented Lagrangian method for nonlinear semidefinite programming (NLSDP). Four modified augmented Lagrangian methods for solving NLSDP based on different algorithmic strategies are proposed. Possibly infeasible limit points of...

  • A new SQP algorithm based on semidefinite programming. Zhu Xiao-rong; Wang Dian-chun; Sang Sheng-ju // Journal of Communication & Computer;Sep2009, Vol. 6 Issue 9, p1 

    The paper gives a new filter-SQP algorithm of the semidefinite programming through combining the sequence nonlinear algorithm of solving the semidefinite programming, low rank conversion, and filter method, which, under certain conditions, proves that the algorithm is global convergence.

  • Extended duality for nonlinear programming. Chen, Yixin; Chen, Minmin // Computational Optimization & Applications;Sep2010, Vol. 47 Issue 1, p33 

    Duality is an important notion for nonlinear programming (NLP). It provides a theoretical foundation for many optimization algorithms. Duality can be used to directly solve NLPs as well as to derive lower bounds of the solution quality which have wide use in other high-level search techniques...

  • Approximate Augmented Lagrangian Functions and Nonlinear Semidefinite Programs. Huang, X. X.; Teo, K. L.; Yang, X. Q. // Acta Mathematica Sinica;Sep2006, Vol. 22 Issue 5, p1283 

    In this paper, an approximate augmented Lagrangian function for nonlinear semidefinite programs is introduced. Some basic properties of the approximate augmented Lagrange function such as monotonicity and convexity are discussed. Necessary and sufficient conditions for approximate strong duality...

  • Exact augmented lagrangian function for nonlinear programming problems with inequality constraints. Du, Xue-wu; Zhang, Lian-sheng; Shang, You-lin; Li, Ming-ming // Applied Mathematics & Mechanics;Dec2005, Vol. 26 Issue 12, p1649 

    An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstrained minimizers of the augmented Lagrangian function on the space of problem...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics