On the Development of Optimization Theory
From MaRDI portal
Cited in
(15)- A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
- Pivot versus interior point methods: Pros and cons
- Comment on the theorems of Farkas and Haar
- A new proof of the Kuhn-Tucker and Farkas theorems
- Multisymplectic variational integrators for nonsmooth Lagrangian continuum mechanics
- Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
- Results of farkas type
- A simple algebraic proof of Farkas's lemma and related theorems
- Farkas' lemma: three decades of generalizations for mathematical optimization
- An application of semi-infinite linear programming: approximation of a continuous function by a polynomial
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems
- A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: The impact of World War II
- New perspective on the Kuhn-Tucker theorem
- Finite-time attractor optimization based on differential lagrange multipliers
- Elementary proof of classical necessary optimality conditions for a mathematical programming problem with inequality constraints
This page was built for publication: On the Development of Optimization Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898452)