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

Conditional gradient method without line-search

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

DOI10.3103/S1066369X18010127zbMath1397.90359OpenAlexW2790138475MaRDI QIDQ1746445

Xianqiang Yang

Publication date: 25 April 2018

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x18010127


zbMATH Keywords

optimization problemsconditional gradient methodstep-size choice


Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)


Related Items (3)

Conditional gradient method for optimization problems with a constraint in the form of the intersection of a convex smooth surface and a convex compact set ⋮ Simplified versions of the conditional gradient method ⋮ A non-monotone conjugate subgradient type method for minimization of convex functions




Cites Work

  • A conditional gradient method with linear rate of convergence for solving convex linear systems
  • New analysis and results for the Frank-Wolfe method




This page was built for publication: Conditional gradient method without line-search

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