Modified partial-update Newton-type algorithms for unary optimization
From MaRDI portal
Publication:1265009
DOI10.1023/A:1022682818387zbMATH Open0911.90298OpenAlexW11698779MaRDI QIDQ1265009FDOQ1265009
Authors: Liang-Ho Chen, Nai-Yang Deng, Jianzhong Zhang
Publication date: 20 April 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022682818387
Recommendations
rank-one updatetrust-region methodsBunch-Parlett factorizationindefinite dogleg curveunary optimization
Cites Work
- Testing Unconstrained Optimization Software
- Title not available (Why is that?)
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Inexact Newton Methods
- Optimization with unary functions
- A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
- Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization
Cited In (4)
- Variants of Partial Update Augmented CLMS Algorithm and Their Performance Analysis
- An improved inexact Newton's method for unary optimization
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- PCG-inexact Newton methods for unary optimization
Uses Software
This page was built for publication: Modified partial-update Newton-type algorithms for unary optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265009)