Solving algorithm NCL's subproblems: the need for interior methods

DOI10.1007/S10013-025-00760-ZMaRDI QIDQ6913285zbMATH OpenFDO

Authors Ding Ma, D. Orban, Michael A. Saunders

Publication date 21 October 2025

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10013-025-00760-Z

zbMATH Keywords

constrained optimizationinterior methodsLICQsparse matrix algebra

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Interior-point methods (90C51)

Cites work

• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• scientific article; zbMATH DE number 46305 (Why is no real title available?)
• scientific article; zbMATH DE number 107545 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• Stabilized optimization via an NCL algorithm
• Symmetric Quasidefinite Matrices
• Trust Region Methods

This page was built for publication: Solving algorithm NCL's subproblems: the need for interior methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913285)