Suchergebnisse - "Feasible descent algorithm"

  • Treffer 1 - 4 von 4
Treffer weiter einschränken
  1. 1
    Buchumschlag

    An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity von Jian, Jin-Bao, Tang, Chun-Ming

    ISSN: 0898-1221, 1873-7668
    Veröffentlicht: Elsevier Ltd 2005
    “… In this paper, a kind of nonlinear optimization problems with nonlinear inequality constraints are discussed, and a new SQP feasible descent algorithm for …”
    Volltext
    Journal Article
    Zu den Favoriten
    Gespeichert in:
  2. 2
    Buchumschlag

    A feasible descent SQP algorithm for general constrained optimization without strict complementarity von Jian, Jin-Bao, Tang, Chun-Ming, Hu, Qing-Jie, Zheng, Hai-Yan

    ISSN: 0377-0427, 1879-1778
    Veröffentlicht: Amsterdam Elsevier B.V 15.08.2005
    Veröffentlicht in Journal of computational and applied mathematics (15.08.2005)
    “… In this paper, a class of optimization problems with equality and inequality constraints is discussed. Firstly, the original problem is transformed to an …”
    Volltext
    Journal Article
    Zu den Favoriten
    Gespeichert in:
  3. 3
    Buchumschlag

    A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity von Jian, Jin-Bao

    ISSN: 0096-3003, 1873-5649
    Veröffentlicht: New York, NY Elsevier Inc 25.03.2005
    Veröffentlicht in Applied mathematics and computation (25.03.2005)
    “… In this paper, optimization problems with nonlinear inequality constraints are discussed, by combining the sequential quadratic programming (SQP) with an new …”
    Volltext
    Journal Article
    Zu den Favoriten
    Gespeichert in:
  4. 4
    Buchumschlag

    A Feasible SQP Method Using Augmented Lagrangian Function for General Constrained Optimization von Xiaowei Jiang, Yueting Yang, Yunlong Lu

    ISBN: 9781467313650, 1467313653
    Veröffentlicht: IEEE 01.06.2012
    “… An feasible SQP method is proposed to solve general optimization problems with equality and inequality constraints. First, we transform the original problem to …”
    Volltext
    Tagungsbericht
    Zu den Favoriten
    Gespeichert in:

Suchwerkzeuge: