Planar quasi-Newton algorithms for unconstrained saddlepoint problems

DOI10.1007/BF00936162zbMath0521.49025OpenAlexW2110455821MaRDI QIDQ1054999

J. Blot

Publication date: 1984

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00936162

zbMATH Keywords

quasi-Newton methodsindefinite quadratic formsconjugate-directions algorithmsplanar iterationsaddlepoint problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming

Cites Work

• Self-Scaling Variable Metric (SSVM) Algorithms
• Solution of Sparse Indefinite Systems of Linear Equations
• The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming
• Conjugate Gradient Methods with Inexact Searches
• A Rapidly Convergent Descent Method for Minimization
• Hyperbolic Pairs in the Method of Conjugate Gradients
• The Convergence of a Class of Double-rank Minimization Algorithms
• The Conjugate Residual Method for Constrained Minimization Problems

This page was built for publication: Planar quasi-Newton algorithms for unconstrained saddlepoint problems