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

On several algorithms of immersion - cutoff for the problem of mathematical programming

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

zbMath1262.90171MaRDI QIDQ447686

Igor' Yaroslavich Zabotin

Publication date: 5 September 2012

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)


zbMATH Keywords

algorithmconvergenceimmersionparallel calculationsseverance


Mathematics Subject Classification ID

Nonlinear programming (90C30)


Related Items (6)

Cutting-plane method based on epigraph approximation with discarding the cutting planes ⋮ A minimization method with approximation of feasible set and epigraph of objective function ⋮ A cutting method with updating approximating sets and its combination with other algorithms ⋮ A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems ⋮ A cutting-plane method without inclusions of approximating sets for conditional minimization ⋮ A two-stage cutting-plane method for conditional minimizing function




This page was built for publication: On several algorithms of immersion - cutoff for the problem of mathematical programming

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