On the implicit programming approach in a class of mathematical programs with equilibrium constraints
Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market
We consider an equilibrium problem with equilibrium constraints (EPEC) arising from the modeling of competition in an electricity spot market (under ISO regulation). For a characterization of equilibrium solutions, so-called M-stationarity conditions are derived. This first requires a structural analysis of the problem, , verifying constraint qualifications. Second, the calmness property of a certain multifunction has to be verified in order to justify using M-stationarity conditions. Third, for...
A note on the relation between strong and M-stationarity for a class of mathematical programs with equilibrium constraints
In this paper, we deal with strong stationarity conditions for mathematical programs with equilibrium constraints (MPEC). The main task in deriving these conditions consists in calculating the Fréchet normal cone to the graph of the solution mapping associated with the underlying generalized equation of the MPEC. We derive an inner approximation to this cone, which is exact under an additional assumption. Even if the latter fails to hold, the inner approximation can be used to check strong stationarity...
Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market
We consider an equilibrium problem with equilibrium constraints (EPEC) arising from the modeling of competition in an electricity spot market (under ISO regulation). For a characterization of equilibrium solutions, so-called M-stationarity conditions are derived. This first requires a structural analysis of the problem, , verifying constraint qualifications. Second, the calmness property of a certain multifunction has to be verified in order to justify...
On necessary optimality conditions in a class of optimization problems
In the paper necessary optimality conditions are derived for the minimization of a locally Lipschitz objective with respect to the consttraints , where is a closed set and is a set-valued map. No convexity requirements are imposed on . The conditions are applied to a generalized mathematical programming problem and to an abstract finite-dimensional optimal control problem.
Discrete optimal control problems with nonsmooth costs
The second-order methods in discrete optimal control problems
On numerical solution of optimal control problems with nonsmooth objectives: Application to economic models
A note on the usage of nondifferentiable exact penalties in some special optimization problems
On the minimum time problem in linear discrete systems with the discrete set of admissible controls
Optimality conditions for a class of mathematical programs with equilibrium constraints: strongly regular case
The paper deals with mathematical programs, where parameter-dependent nonlinear complementarity problems arise as side constraints. Using the generalized differential calculus for nonsmooth and set-valued mappings due to B. Mordukhovich, we compute the so-called coderivative of the map assigning the parameter the (set of) solutions to the respective complementarity problem. This enables, in particular, to derive useful 1st-order necessary optimality conditions, provided the complementarity problem...
A note on a class of equilibrium problems with equilibrium constraints
The paper concerns a two-level hierarchical game, where the players on each level behave noncooperatively. In this way one can model eg an oligopolistic market with several large and several small firms. We derive two types of necessary conditions for a solution of this game and discuss briefly the possibilities of its computation.
On Fenchel dual schemes in convex optimal control problems
Duality theory in mathematical programming and optimal control
An application of conjugate duality for numerical solution of continuous convex optimal control problems
Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian-Fromovitz Constraint Qualification, we establish relationships between tilt stability and some other stability notions in constrained optimization. Involving...
Page 1