Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A nonmonotone line search algorithm for nonsmooth discrete minimax problem

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

zbMATH Open1105.90351MaRDI QIDQ5483068FDOQ5483068


Authors: Xing-Ju Cai, Wenyu Sun Edit this on Wikidata


Publication date: 16 August 2006





Recommendations

  • Global convergence of line search method for nonsmooth optimization
  • scientific article; zbMATH DE number 2143965
  • scientific article; zbMATH DE number 1180444
  • Nonmonotone algorithm for minimax optimization problems
  • A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems


zbMATH Keywords

critical point


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47)



Cited In (6)

  • Title not available (Why is that?)
  • Global convergence of line search method for nonsmooth optimization
  • Nonmonotone line search for minimax problems
  • A nonmonotone line search based algorithm for distribution center location selected
  • A nonmonotone line search method for noisy minimization
  • Nonmonotone adaptive trust-region method for unconstrained optimization problems





This page was built for publication: A nonmonotone line search algorithm for nonsmooth discrete minimax problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483068)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5483068&oldid=30036111"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 03:01. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki