scholarly journals Variational problems with inequality constraints

1962 ◽  
Vol 4 (2) ◽  
pp. 297-308 ◽  
Author(s):  
Stuart Dreyfus
Mathematics ◽  
2019 ◽  
Vol 7 (6) ◽  
pp. 537 ◽  
Author(s):  
Hunter Johnston ◽  
Carl Leake ◽  
Yalchin Efendiev ◽  
Daniele Mortari

In this paper, we consider several new applications of the recently introduced mathematical framework of the Theory of Connections (ToC). This framework transforms constrained problems into unconstrained problems by introducing constraint-free variables. Using this transformation, various ordinary differential equations (ODEs), partial differential equations (PDEs) and variational problems can be formulated where the constraints are always satisfied. The resulting equations can then be easily solved by introducing a global basis function set (e.g., Chebyshev, Legendre, etc.) and minimizing a residual at pre-defined collocation points. In this paper, we highlight the utility of ToC by introducing various problems that can be solved using this framework including: (1) analytical linear constraint optimization; (2) the brachistochrone problem; (3) over-constrained differential equations; (4) inequality constraints; and (5) triangular domains.


1963 ◽  
Vol 3 (4) ◽  
pp. 449-453
Author(s):  
M. A. Hanson

Certain optimization problems involving inequality constraints, known as optimal control problems have been extensively studied during recent years especially in relation to the calculation of optimal rocket thrusts and trajectories. A summary of these works is given by Berkovitz [1] who also establishes necessary conditions for the existence of solutions for a wide class of such problems.


Mathematics ◽  
2021 ◽  
Vol 9 (19) ◽  
pp. 2478
Author(s):  
Savin Treanţă

By considering the new forms of the notions of lower semicontinuity, pseudomonotonicity, hemicontinuity and monotonicity of the considered scalar multiple integral functional, in this paper we study the well-posedness of a new class of variational problems with variational inequality constraints. More specifically, by defining the set of approximating solutions for the class of variational problems under study, we establish several results on well-posedness.


Author(s):  
S Dahlke ◽  
T M Surowiec

Abstract Many problems in optimal control, PDE-constrained optimization and constrained variational problems include pointwise bound constraints on the feasible controls and state variables. Most well-known approaches for treating such pointwise inequality constraints in numerical methods rely on finite element discretizations and interpolation arguments. We propose an alternative means of discretizing pointwise bound constraints using a wavelet-based discretization. The main results show that the discrete, approximating sets converge in the sense of Mosco to the original sets. In situations of higher regularity, convergence rates follow immediately from the underlying wavelet theory. The approach exploits the fact that one can easily transform between a given multiscale wavelet representation and single-scale representation with linear complexity. This allows, for example, a direct treatment of variational problems involving fractional operators, without the need for lifting techniques. We demonstrate this fact with several numerical examples of fractional obstacle problems.


2009 ◽  
Vol 19 (1) ◽  
pp. 85-99 ◽  
Author(s):  
Ştefan Mititelu ◽  
I.M. Stancu-Minasian

The necessary conditions for (normal) efficient solutions to a class of multi-objective fractional variational problems (MFP) with nonlinear equality and inequality constraints are established using a parametric approach to relate efficient solutions of a fractional problem and a non-fractional problem. Based on these normal efficiency criteria a Mond-Weir type dual is formulated and appropriate duality theorems are proved assuming (?,b) - quasi-invexity of the functions involved.


Sign in / Sign up

Export Citation Format

Share Document