Results 231 to 240 of about 50,039 (279)

An optimal design problem with perimeter penalization

Calculus of Variations and Partial Differential Equations, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AMBROSIO, Luigi, Buttazzo G.
openaire   +2 more sources

On necessary optimality conditions and exact penalization for a constrained fractional optimal control problem

Optimal Control Applications and Methods, 2022
AbstractThe purpose of this article is twofold. We first develop the first‐order necessary optimality conditions for a general constrained fractional optimal control problem using calculus of variation. These conditions are of the form of fractional ordinary differential equations which reduce to the conventional Euler–Lagrange equations when the ...
Song Wang, Wen Li, Chongyang Liu
openaire   +1 more source

Penalization techniques in L ∞ optimization problems with unbounded horizon

Annals of Operations Research, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aragone, Laura S.   +2 more
openaire   +2 more sources

On the Penalization Approach to Optimal Control Problems

IFAC Proceedings Volumes, 2000
Abstract The Exact Penalization Technique is applied to treat optimal control problems in a system described by ordinary differential equations. The resulting functional is essentially nonsmooth but directionally differentiable (even subdifferentiable). Differential equations are viewed as constraints and are “removed” by introducing an exact penalty
Vladimir F. Demyanov   +2 more
openaire   +1 more source

An optimization algorithm for a penalized knapsack problem

Operations Research Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Ceselli, G. Righini
openaire   +2 more sources

Optimal Control Problems and Penalization

2000
The Exact Penalization Technique is applied to treat optimal control problems in a system described by ordinary differential equations. The resulting functional is essentially nonsmooth but directionally differentiable (even subdifferentiable). Differential equations are viewed as constraints and are “removed” by introducing an exact penalty function ...
Vladimir F. Demyanov   +2 more
openaire   +1 more source

Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems

SIAM Journal on Optimization, 1997
Summary: The generalized bilevel programming problem (GBLP) is a bilevel mathematical program where the lower level is a variational inequality. In this paper we prove that if the objective function of a GBLP is uniformly Lipschitz continuous in the lower level decision variable with respect to the upper level decision variable, then using certain ...
Ye, J. J., Zhu, D. L., Zhu, Q. J.
openaire   +2 more sources

A modified local quadratic approximation algorithm for penalized optimization problems

Computational Statistics & Data Analysis, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sangin Lee, Sunghoon Kwon, Yongdai Kim
openaire   +1 more source

Home - About - Disclaimer - Privacy