Scholarlink

<p>This study proposes a cubic regularization of the Newton method for generating weakly efficient points of unconstrained vector optimization problems under no convexity assumption on the objective function. It is observed that at a given iterate, the cubic regularized Newton direction is not necessarily a descent direction. In generating the sequence of iterates, no line search is utilized to find a suitable step length to move along the cubic regularized Newton direction. Yet, the proposed method exhibits the global convergence property with <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10957_2025_2726_Article_IEq1.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="64" /> </InlineMediaObject> <EquationSource Format="TEX">\(O(k^{-2/3})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>O</mi> <mo stretchy="false">(</mo> <msup> <mi>k</mi> <mrow> <mo>-</mo> <mn>2</mn> <mo stretchy="false">/</mo> <mn>3</mn> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> rate of convergence. Further, the local q-quadratic convergence of the Newton method is also retained in the cubic regularization. A new stopping condition is used, which enforces the proposed method to enter in close neighborhood of non-weakly efficient points that are stationary. Thus, the studied technique ends up generating weakly efficient points, not just Pareto critical points. In addition, conditions on the choice of regularization parameter value under which the full cubic regularized Newton step becomes descent are derived. Performance profiles and comparison of the derived method with the existing methods on several test examples are also provided.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Cubic Regularization Technique of the Newton Method for Vector Optimization

  • 期刊论文

  • 发表日期：

    2025年8月5日

查看全文
  • Debdas Ghosh

摘要

This study proposes a cubic regularization of the Newton method for generating weakly efficient points of unconstrained vector optimization problems under no convexity assumption on the objective function. It is observed that at a given iterate, the cubic regularized Newton direction is not necessarily a descent direction. In generating the sequence of iterates, no line search is utilized to find a suitable step length to move along the cubic regularized Newton direction. Yet, the proposed method exhibits the global convergence property with \(O(k^{-2/3})\) O ( k - 2 / 3 ) rate of convergence. Further, the local q-quadratic convergence of the Newton method is also retained in the cubic regularization. A new stopping condition is used, which enforces the proposed method to enter in close neighborhood of non-weakly efficient points that are stationary. Thus, the studied technique ends up generating weakly efficient points, not just Pareto critical points. In addition, conditions on the choice of regularization parameter value under which the full cubic regularized Newton step becomes descent are derived. Performance profiles and comparison of the derived method with the existing methods on several test examples are also provided.