Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

ellipsoid method · Vinony

EntityQ378574· pop 7· linked from 147 articles

ellipsoid method

Sign in to save

iterative method for minimizing convex functions

Connections

mathematical optimization

linear programming

greedy algorithm

Bellman–Ford algorithm

convex optimization

interior point method

International Standard Book Number

digital object identifier

International Standard Serial Number

Dijkstra's algorithm

circumscribed circle

dynamic programming

George Bernard Dantzig

convex function

computational complexity theory

Categories

Combinatorial optimization Convex optimization Ellipsoids Linear programming

Sources

wikipedia.externallinksexternallink

What links here147 pages

simplex algorithm

mathematical optimization

Broyden–Fletcher–Goldfarb–Shanno algorithm

nonlinear programming

Dijkstra's algorithm

Fulkerson Prize

convex optimization

Firefly algorithm

integer programming

ant colony optimization algorithms

Moscow Institute of Physics and Technology

golden section search

Steinitz's theorem

Dinic's algorithm

Arkadi Nemirovski

register allocation

Newton's method in optimization

Coordinate descent

quadratic programming

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Broyden–Fletcher–Goldfarb–Shanno algorithm

Entitydist 0.51

Entitydist 0.53

Closed convex function

Entitydist 0.56

Inverse iteration

Entitydist 0.56

predictor–corrector method

Entitydist 0.57

Linear least squares

Entitydist 0.58

proper convex function

Entitydist 0.58

finite-volume method

Entitydist 0.60

numerical method

Entitydist 0.61

boundary element method

Entitydist 0.61

Jacobi elliptic functions

Entitydist 0.63

Scheffé's method

Entitydist 0.63