1,563 research outputs found
Optimization and Equilibrium Problems with Equilibrium Constraints
The paper concerns optimization and equilibrium problems with the so-called equilibrium constraints (MPEC and EPEC), which frequently appear in applications to operations research. These classes of problems can be naturally unified in the framework of multiobjective optimization with constraints governed by parametric variational systems (generalized equations, variational inequalities, complementarity problems, etc.). We focus on necessary conditions for optimal solutions to MPECs and EPECs under general assumptions in finite-dimensional spaces. Since such problems are intrinsically nonsmooth, we use advanced tools of generalized differentiation to study optimal solutions by methods of modern variational analysis. The general results obtained are concretized for special classes of MPECs and EPECs important in applications
Recommended from our members
Using EPECs to model bilevel games in restructured electricity markets with locational prices
CWPE0619 (EPRG0602) Xinmin Hu and Daniel Ralph (Feb 2006) Using EPECs to model bilevel games in restructured electricity markets with locational prices We study a bilevel noncooperative game-theoretic model of electricity markets with locational marginal prices. Each player faces a bilevel optimization problem that we remodel as a mathematical program with equilibrium constraints, MPEC. This gives an EPEC, equilibrium problem with equilibrium constraints. We establish sufficient conditions for existence of pure strategy Nash equilibria for this class of bilevel games and give some applications. We show by examples the effect of network transmission limits, i.e. congestion, on existence of equilibria. Then we study, for more general EPECs, the weaker pure strategy concepts of local Nash and Nash stationary equilibria. We model the latter via complementarity problems, CPs. Finally, we present numerical examples of methods that attempt to find local Nash or Nash stationary equilibria of randomly generated electricity market games. The CP solver PATH is found to be rather effective in this context
Equilibrium Problems with Equilibrium Constraints via Multiobjective Optimization
The paper concerns a new class of optimization-related problems called Equilibrium Problems with Equilibrium Constraints (EPECs). One may treat them as two level hierarchical problems, which involve equilibria at both lower and upper levels. Such problems naturally appear in various applications providing an equilibrium counterpart (at the upper level) of Mathematical Programs with Equilibrium Constraints (MPECs). We develop a unified approach to both EPECs and MPECs from the viewpoint of multiobjective optimization subject to equilibrium constraints. The problems of this type are intrinsically nonsmooth and require the use of generalized differentiation for their analysis and applications. This paper presents necessary optimality conditions for EPECs in finite-dimensional spaces based an advanced generalized variational tools of variational analysis. The optimality conditions are derived in normal form under certain qualification requirements, which can be regarded as proper analogs of the classical Mangasarian-Fromovitz constraint qualification in the general settings under consideration
A Simple and Efficient Algorithm for Nonlinear Model Predictive Control
We present PANOC, a new algorithm for solving optimal control problems
arising in nonlinear model predictive control (NMPC). A usual approach to this
type of problems is sequential quadratic programming (SQP), which requires the
solution of a quadratic program at every iteration and, consequently, inner
iterative procedures. As a result, when the problem is ill-conditioned or the
prediction horizon is large, each outer iteration becomes computationally very
expensive. We propose a line-search algorithm that combines forward-backward
iterations (FB) and Newton-type steps over the recently introduced
forward-backward envelope (FBE), a continuous, real-valued, exact merit
function for the original problem. The curvature information of Newton-type
methods enables asymptotic superlinear rates under mild assumptions at the
limit point, and the proposed algorithm is based on very simple operations:
access to first-order information of the cost and dynamics and low-cost direct
linear algebra. No inner iterative procedure nor Hessian evaluation is
required, making our approach computationally simpler than SQP methods. The
low-memory requirements and simple implementation make our method particularly
suited for embedded NMPC applications
International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book
The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions.
This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more
- …