Pages that link to "Item:Q2270139"
From MaRDI portal
The following pages link to An algorithm for computing solutions of variational problems with global convexity constraints (Q2270139):
Displaying 16 items.
- Adaptive, anisotropic and hierarchical cones of discrete convex functions (Q264117) (← links)
- The numerical solution of Newton's problem of least resistance (Q463735) (← links)
- \{Euclidean, metric, and Wasserstein\} gradient flows: an overview (Q523629) (← links)
- When is multidimensional screening a convex program? (Q533086) (← links)
- On the strategic use of risk and undesirable goods in multidimensional screening (Q660097) (← links)
- An iterated projection approach to variational problems under generalized convexity constraints (Q681937) (← links)
- Discretization of functionals involving the Monge-Ampère operator (Q728457) (← links)
- Risk minimization and optimal derivative design in a principal agent game (Q841647) (← links)
- Conforming approximation of convex functions with the finite element method (Q1679216) (← links)
- Efficiency and equilibria in games of optimal derivative design (Q1938971) (← links)
- Une méthode numérique pour les problèmes variationnels sous contrainte de convexité (Q4949614) (← links)
- A New Algorithm To Solve Calculus Of Variations Problems Using Wolef's Convergence Theory,Part 1:Theory And Algorithm (Q5689845) (← links)
- Linear-Time Convexity Test for Low-Order Piecewise Polynomials (Q5857296) (← links)
- Multidimensional screening after 37 years (Q6596157) (← links)
- A general solution to the quasi linear screening problem (Q6615358) (← links)
- A duality and free boundary approach to adverse selection (Q6669906) (← links)
