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

Methods of solving systems of convex programming problems

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

DOI10.1016/0041-5553(87)90151-0zbMath0664.90071OpenAlexW2018441137MaRDI QIDQ3815870

Anatoliĭ Sergeevich Antipin

Publication date: 1987

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(87)90151-0


zbMATH Keywords

decompositionfixed pointLagrangiansaddle point


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)


Related Items (1)

Regularization method for searching for an equilibrium point in two-person saddle-point games with approximate input data






This page was built for publication: Methods of solving systems of convex programming problems

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