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

Two alternatives for the cubic algorithm

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

DOI10.1016/0022-247X(87)90088-6zbMath0631.90056OpenAlexW1994631618MaRDI QIDQ1095036

Efim A. Galperin

Publication date: 1987

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(87)90088-6


zbMATH Keywords

approximate solutionsnon-convexcubic algorithmnon-robust


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)


Related Items (5)

The Beta-algorithm ⋮ The integer cubic algorithm ⋮ Integral global optimization method for differential games with application to pursuit-evasion games ⋮ When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation ⋮ Global optimization to prescribed accuracy



Cites Work

  • The cubic algorithm
  • A linear algorithm for determining the separation of convex polyhedra


This page was built for publication: Two alternatives for the cubic algorithm

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