Results 211 to 220 of about 12,161,396 (244)

Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints

SIAM Journal on Optimization, 2000
Summary: We consider nonconvex quadratic optimization problems with binary constraints. Our main result identifies a class of quadratic problems for which a given feasible point is global optimal. We also establish a necessary global optimality condition. These conditions are expressed in a simple way in terms of the problem's data.
Amir Beck, Marc Teboulle
openaire   +2 more sources

Global optimality conditions and exact penalization

Optimization Letters, 2017
The author considers nonconvex optimization problems with inequality constraints. Both the objective function and the functions occuring in the constraints are d.-c. functions, i.e., they are expressed as the difference of two convex functions. All functions of the problems are differentiable. It is further assumed that the set of feasible solutions is
openaire   +1 more source

On Global Optimality Conditions via Separation Functions

Journal of Optimization Theory and Applications, 2001
This paper examines some axiomatic definitions of separation functions that can be employed fruitfully in the analysis of side-constrained extremum problems. A study of their general properties points out connections with abstract convex analysis and recent generalizations of Lagrangian approaches to duality and exact penalty methods.
Rubinov, AM, UDERZO, AMOS
openaire   +3 more sources

A note on sufficient global optimality conditions for fixed charge quadratic programs [PDF]

Applied Mathematics Letters, 2009
In this work we establish conditions for a feasible point to be a global minimizer of a fixed charge quadratic model program. This program has a wide variety of classic applications, for instance, in facility location, scheduling and portfolio selection.
Vaithilingam Jeyakumar
exaly   +2 more sources

New Global Optimality Conditions in Optimal Control Theory

SIAM Journal on Control and Optimization, 1983
We give global optimality conditions expressed in terms of a function $\phi $ which satisfies conditions related to the Hamilton–Jacobi equation. Thus our results are in the spirit of sufficient conditions for optimality associated with Caratheodory in the calculus of variations, and of the verification theorems of optimal control theory.
openaire   +1 more source

On global search based on global optimality conditions

1994
We consider two kinds of nonconvex problems: convex maximization and reverseconvex optimization. Using the new information about the problems in the form of Global Optimality Search Algorithms [1–5], we construct Global Search Algorithms and study their global convergence.
openaire   +1 more source

Global Optimality Conditions for Nonnormal Control Problems

IMA Journal of Mathematical Control and Information, 1985
Let a standard deterministic optimal control problem be given, together with a feasible trajectory. It is well known that if the Hamilton-Jacobi equation (HJ) has a smooth solution relative to the given trajectory, then the trajectory is optimal. \textit{F. H. Clarke} and \textit{R. B. Vinter} [SIAM J.
Vinter, R. B., Mendoza, L. A.
openaire   +1 more source

Optimality Conditions for Nonconvex Nonsmooth Optimization via Global Derivatives

Journal of Optimization Theory and Applications, 2019
The lower and upper global directional derivatives of a proper function \(h:\mathbb{R}^{n}\rightarrow \overline{\mathbb{R}}\) at \(\overline{x}\in\mathrm{dom}\, h\) in the direction \(u\in \mathbb{R}^{n}\) are defined by \(h_{\epsilon }(\overline{x};u):=\inf_{t\in ]0,\epsilon ]}\frac{h(\overline{x}+tu)-h(\overline{x})}{t}\) and \(h^{\epsilon ...
openaire   +3 more sources

Global Optimality Conditions and Near-Perfect Optimization in Coding

2005
Finding ways of recognizing global optimum is the very fundamental, unsolved problem in existing optimization theories. We can not establish a true theory of optimization without it. Also, it is very hard to construct effective algorithms for finding global optimum. This paper presented a new optimization principle, called cooperative optimization, for
openaire   +2 more sources

Global optimality conditions for nonlinear optimization problems

Evolutionary Intelligence, 2022
Haitao Zhong, Mingfa Zheng, Wei Chen, Aoyu Zheng   +3 more
openaire   +2 more sources