Method of steepest descent for two-dimensional problems of calculus of variations
From MaRDI portal
Publication:5745753
Recommendations
- An old problem and new tools
- Exact penalty functions and problems of the calculus of variations
- Application of the subdifferential descent method to a classical nonsmooth variational problem
- Numerical methods in problems of calculus of variations for functionals depending on higher order derivatives
- On equivalence of the method of steepest descent and the method of hypodifferential descent in some constrained optimization problems
Cites work
- scientific article; zbMATH DE number 3136957 (Why is no real title available?)
- scientific article; zbMATH DE number 3760758 (Why is no real title available?)
- scientific article; zbMATH DE number 3634008 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- scientific article; zbMATH DE number 3103269 (Why is no real title available?)
- Exact penalization via dini and hadamard conditional derivatives
- Exact penalty functions in isoperimetric problems
- Exact penalty functions in problems of nonsmooth optimization
- Nonsmooth mechanics and applications
- Nonsmooth optimization
- Optimal control problems via exact penalty functions
- Quasidifferentiability and nonsmooth modelling in mechanics, engineering and economics
- Variational control problems with constraints via exact penalization
Cited in
(9)- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- scientific article; zbMATH DE number 6792615 (Why is no real title available?)
- Application of the subdifferential descent method to a classical nonsmooth variational problem
- Numerical methods in problems of calculus of variations for functionals depending on higher order derivatives
- On equivalence of the method of steepest descent and the method of hypodifferential descent in some constrained optimization problems
- Exact penalty functions and problems of the calculus of variations
- Direct Methods in the Parametric Moving Boundary Variational Problem
- An old problem and new tools
- Comparative study of two fast algorithms for projecting a point to the standard simplex
This page was built for publication: Method of steepest descent for two-dimensional problems of calculus of variations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745753)