We construct a nonlinear least-squares finite element method for computing the smooth convex solutions of the Dirichlet boundary value problem of the Monge-Ampère equation on strictly convex smooth domains in
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
. It is based on an isoparametric finite element space with exotic degrees of freedom that can enforce the convexity of the approximate solutions. A priori anda posteriori error estimates together with corroborating numerical results are presented. -
A nonlinear least-squares finite element method for strong solutions of the Dirichlet boundary value problem of a two-dimensional Pucci equation on convex polygonal domains is investigated in this paper. We obtain a priori and a posteriori error estimates and present corroborating numerical results, where the discrete nonsmooth and nonlinear optimization problems are solved by an active set method and an alternating direction method with multipliers.more » « lessFree, publicly-accessible full text available April 26, 2025
-
We consider C0 interior penalty methods for a linear-quadratic elliptic distributed optimal control problem with pointwise state constraints in two spatial dimensions, where the cost function tracks the state at points, curves and regions of the domain. Error estimates and numerical results that illustrate the performance of the methods are presented.more » « lessFree, publicly-accessible full text available February 1, 2025
-
Abstract We construct a symmetric interior penalty method for an elliptic distributed optimal control problem with pointwise state constraints on general polygonal domains.The resulting discrete problems are quadratic programs with simple box constraints that can be solved efficiently by a primal-dual active set algorithm.Both theoretical analysis and corroborating numerical results are presented.