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 general method of finding the direction of descent in \(\varepsilon\)-subgradient methods

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

DOI10.1007/BF02367719zbMath0883.49024OpenAlexW2070950301MaRDI QIDQ1912454

V. V. Eisman, A. I. Korablev

Publication date: 30 May 1996

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02367719


zbMATH Keywords

minimizationdescent direction\(\varepsilon\)-subgradient method


Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)




Cites Work

  • Finding the nearest point in A polytope
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1912454&oldid=14331400"
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 15:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki