Method of steepest descent for two-dimensional problems of calculus of variations
From MaRDI portal
Publication:5745753
DOI10.1007/978-1-4614-8615-2_7zbMATH Open1280.49039OpenAlexW342979622MaRDI QIDQ5745753FDOQ5745753
Authors: Maxim Dolgopolik, G. Sh. Tamasyan
Publication date: 31 January 2014
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-8615-2_7
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonsmooth optimization
- Exact penalty functions in problems of nonsmooth optimization
- Title not available (Why is that?)
- Nonsmooth mechanics and applications
- Exact penalization via dini and hadamard conditional derivatives
- Title not available (Why is that?)
- Quasidifferentiability and nonsmooth modelling in mechanics, engineering and economics
- Optimal control problems via exact penalty functions
- Exact penalty functions in isoperimetric problems
- Variational control problems with constraints via exact penalization
Cited In (9)
- Title not available (Why is that?)
- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- 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)