Planar quasi-Newton algorithms for unconstrained saddlepoint problems

DOI10.1007/BF00936162MaRDI QIDQ1054999zbMATH OpenOpenAlexFDO

Authors 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

conjugate-directions algorithmsindefinite quadratic formsplanar iterationquasi-Newton methodssaddlepoint problems

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(1)

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

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

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