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

A two-step linearization method for minimization problems.

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

zbMath1161.90460MaRDI QIDQ1425857

Anatoliĭ Sergeevich Antipin, Angelia Nedić, M. D. Yachimovich

Publication date: 18 March 2004

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



Mathematics Subject Classification ID

Convex programming (90C25)


Related Items (3)

Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set ⋮ Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set ⋮ Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set







This page was built for publication: A two-step linearization method for minimization problems.

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