AbstractWe establish a sequential version of the Maximum Theorem which is suitable for solving general optimization problems by successive approximation, e.g. finite truncation of an ”infinite” optimization problem. This can then be used to obtain convergence of optimal values and (partial) convergence of optimal solutions. In particular, we do this for general problems in infinite horizon optimization and semi-infinite programming
The discretization approach for solving semi-infinite optimization problems is considered. We are in...
In this thesis we examine the following type of problem: Given a sequence of functions f(,n)(x) whic...
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiab...
AbstractWe establish a sequential version of the Maximum Theorem which is suitable for solving gener...
We extend the recent approach of Papadimitrou and Yannakakis that relates the approximation properti...
The content of this work is a presentation of algorithms solving optimization problems with a max-se...
AbstractIt has been realized for some time that most realistic optimization problems defy analytical...
We examine the maximum theorem by Berge from the point of view of Bishop style constructive mathemat...
The paper studies discrete/finite-difference approximations of optimal control problems go...
Abstract Necessary first-order sequential optimality conditions provide adequate theoretical tools t...
. Dynamic optimization problems, including optimal control problems, have typically relied on the so...
In this paper, sufficient and necessary maximum conditions are established for a class of mathematic...
This note deals with a semi-infinite optimization problem which is defined by infinitely many inequa...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
In this paper, we consider a class of quadratic maximization problems. One important instance in tha...
The discretization approach for solving semi-infinite optimization problems is considered. We are in...
In this thesis we examine the following type of problem: Given a sequence of functions f(,n)(x) whic...
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiab...
AbstractWe establish a sequential version of the Maximum Theorem which is suitable for solving gener...
We extend the recent approach of Papadimitrou and Yannakakis that relates the approximation properti...
The content of this work is a presentation of algorithms solving optimization problems with a max-se...
AbstractIt has been realized for some time that most realistic optimization problems defy analytical...
We examine the maximum theorem by Berge from the point of view of Bishop style constructive mathemat...
The paper studies discrete/finite-difference approximations of optimal control problems go...
Abstract Necessary first-order sequential optimality conditions provide adequate theoretical tools t...
. Dynamic optimization problems, including optimal control problems, have typically relied on the so...
In this paper, sufficient and necessary maximum conditions are established for a class of mathematic...
This note deals with a semi-infinite optimization problem which is defined by infinitely many inequa...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
In this paper, we consider a class of quadratic maximization problems. One important instance in tha...
The discretization approach for solving semi-infinite optimization problems is considered. We are in...
In this thesis we examine the following type of problem: Given a sequence of functions f(,n)(x) whic...
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiab...