On a Method of Courant for Minimizing Functionals
From MaRDI portal
Cited in
(11)- Algorithm model for penalty functions-type iterative pcedures
- A dynamic programming approach to the formulation and solution of finite element equations
- Minimization methods with constraints
- The impelling function method applied to global optimization
- Invariant imbedding and the solution of finite element equations
- Penalty methods for mathematical programming in E^n with general constraint sets
- New necessary conditions of optimality for control problems with state- variable inequality constraints
- Convergente rate of a penalty-function scheme
- A constructive proof of the Kuhn-Tucker multiplier rule
- On infinite-dimensional convex programs
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
This page was built for publication: On a Method of Courant for Minimizing Functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5725001)