Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A piecewise line-search technique for maintaining the positive definiteness of the matrices in the SQP method

From MaRDI portal
Publication:1583583
Jump to:navigation, search

DOI10.1023/A:1008701324575zbMath0963.90059OpenAlexW1567007743MaRDI QIDQ1583583

Paul Armand, Gilbert, Jean Charles

Publication date: 21 January 2001

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

Full work available at URL: https://doi.org/10.1023/a:1008701324575


zbMATH Keywords

successive quadratic programmingquasi-Newton algorithmequality constrained optimizationBFGS formulapiecewise line-search


Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)


Related Items (1)

Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method




This page was built for publication: A piecewise line-search technique for maintaining the positive definiteness of the matrices in the SQP method

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1583583&oldid=13868697"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki