CONVERGENCE TO A SECOND-ORDER CRITICAL POINT BY A TRUST-REGION SQP METHOD WITH A NONSMOOTH MERIT FUNCTION

Hiroshi Yabe & Hiroshi Yamashita

Journal of the Operations Research Society of Japan2025https://doi.org/10.15807/jorsj.68.1article
ABDC B
Weight
0.50

What the paper says

In this paper, we deal with a trust-region sequential quadratic programming (SQP) method with a nonsmooth merit function for solving nonlinear optimization poblems. Based on the method proposed by Yamashita and Dan (2005), our method calculates search directions by solving the two types of subproblems, which are a convex QP subproblem and a linear system of equations. When possible, we execute a search along the negative-curvature direction. The proposed method generates negative-curvature directions in the existence of the nonsmooth term in the merit function. We show that the generated sequence converges to a point that satisfies the first-order and second-order optimality conditions.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.15807/jorsj.68.1

Or copy a formatted citation

@article{hiroshi2025,
  title        = {{CONVERGENCE TO A SECOND-ORDER CRITICAL POINT BY A TRUST-REGION SQP METHOD WITH A NONSMOOTH MERIT FUNCTION}},
  author       = {Hiroshi Yabe & Hiroshi Yamashita},
  journal      = {Journal of the Operations Research Society of Japan},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.15807/jorsj.68.1},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

CONVERGENCE TO A SECOND-ORDER CRITICAL POINT BY A TRUST-REGION SQP METHOD WITH A NONSMOOTH MERIT FUNCTION

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.