Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
From MaRDI portal
Publication:4891017
Recommendations
- On the validity of the Euler-Lagrange equation
- On the Validity of the Maximum Principle and of the Euler--Lagrange Equation for a Minimum Problem Depending on the Gradient
- On the validity of the Euler-Lagrange equation
- On the generalized Euler-Lagrange equations
- scientific article; zbMATH DE number 1377936
Cited in
(58)- Extensions of Gauss quadrature via linear programming
- Regularized robust optimization: the optimal portfolio execution case
- Optimal control of delay systems with differential and algebraic dynamic constraints
- Semidefinite representations of noncompact convex sets
- Solving dual problems using a coevolutionary optimization algorithm
- Maximal solutions of sparse analysis regularization
- Necessary conditions for the neutral problem of Bolza with continuously varying time delay
- Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones
- The optimal strategy for a bioeconomical model of a harvesting renewable resource problem.
- Optimal control of nonautonomous functional-differential inclusions of neutral type
- Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Semi-continuous network flow problems
- Concurrence revisited
- Polynomial-time algorithms for submodular Laplacian systems
- Distance majorization and its applications
- Optimal control of evolution inclusions
- Discussion: Latent variable graphical model selection via convex optimization
- Exact worst-case performance of first-order methods for composite convex optimization
- Ground-state spaces of frustration-free Hamiltonians
- Dualization of the Euler and Hamiltonian inclusions
- Sharp oracle inequalities for low-complexity priors
- When terminal facelift enforces delta constraints
- On the numerical solution of some eikonal equations: an elliptic solver approach
- The degrees of freedom of partly smooth regularizers
- Dynamic mean-LPM and mean-CVaR portfolio optimization in continuous-time
- Latent variable graphical model selection via convex optimization
- Distributed caching over heterogeneous mobile networks
- Total cyclic variation and generalizations
- CVaR norm and applications in optimization
- Approximate KKT points and a proximity measure for termination
- Discussion: Latent variable graphical model selection via convex optimization
- On improved predictive density estimation with parametric constraints
- Good formal structures for flat meromorphic connections. I: Surfaces
- Optimization of SMES and superconducting magnets with a derivative free deterministic method.
- Optimal control of difference, differential, and differential-difference inclusions
- Liquidity-adjusted risk measures
- Discussion: Latent variable graphical model selection via convex optimization
- Segmentation of ARX-models using sum-of-norms regularization
- Discussion: Latent variable graphical model selection via convex optimization
- Discussion: Latent variable graphical model selection via convex optimization
- Global optimization of bounded factorable functions with discontinuities
- Infinite-dimensional reductive monoids associated to highest weight representations of Kac-Moody groups
- Stroboscopic strategy in the method of resolving functions for game control problems with terminal payoff function
- Local linear regression for functional data
- Lagrange-type duality in DC programming problems with equivalent DC inequalities
- Rejoinder: Latent variable graphical model selection via convex optimization
- Quasi-equilibrium grid algorithm: geometric construction for model reduction
- Primal-dual interior-point method for thermodynamic gas-particle partitioning
- Smoothing proximal gradient method for general structured sparse regression
- Generalized Euler-Lagrange equation for nonsmooth calculus of variations
- Identification for control: Optimal input intended to identify a minimum variance controller
- Discussion: Latent variable graphical model selection via convex optimization
- Remarks on necessary conditions for minimizers of one-dimensional variational problems
- Supermartingales in Prediction with Expert Advice
- A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications
- Maximum Principles for Optimal Control Problems with Differential Inclusions
This page was built for publication: Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891017)
