✦ LIBER ✦

On piecewise quadratic Newton and trust region problems

✍ Scribed by J. Sun

Book ID: 110591406
Publisher: Springer-Verlag
Year: 1997
Tongue: English
Weight: 780 KB
Volume: 76
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf02614393

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Planar Piecewise Quadratic 1-Cent

On the Planar Piecewise Quadratic 1-Center Problem

✍ J. Puerto; A. M. Rodríguez-Chía; A. Tamir 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 696 KB

Regularized Lagrangian duality for linea

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems

✍ V. Jeyakumar; Guoyin Li 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 200 KB

A nonmonotone trust region method based

A nonmonotone trust region method based on simple quadratic models

✍ Zhou, Qunyan; Chen, Jun; Xie, Zhengwei 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 495 KB

A Feasible Trust-Region Sequential Quadr

A Feasible Trust-Region Sequential Quadratic Programming Algorithm

✍ Wright, Stephen J.; Tenny, Matthew J. 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 293 KB

Strong duality for a trust-region type r

Strong duality for a trust-region type relaxation of the quadratic assignment problem

✍ Kurt Anstreicher; Xin Chen; Henry Wolkowicz; Ya-Xiang Yuan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Lagrangian duality underlies many efficient algorithms for convex minimization problems. A key ingredient is strong duality. Lagrangian relaxation also provides lower bounds for non-convex problems, where the quality of the lower bound depends on the duality gap. Quadratically constrained quadratic

Trust Region Methods || 11. Nonsmooth Pr

Trust Region Methods || 11. Nonsmooth Problems

✍ Conn, Andrew R.; Gould, Nicholas I. M.; Toint, Philippe L. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics ⚖ 368 KB