scholarly journals On implicit variables in optimization theory

2021 ◽  
Vol Volume 2 (Original research articles) ◽  
Author(s):  
Matúš Benko ◽  
Patrick Mehlitz
Keyword(s):  
Optimization Problems ◽  
Constraint Qualifications ◽  
Optimization Theory ◽  
Mathematical Optimization ◽  
General Setting ◽  
Necessary Optimality Conditions ◽  
Detailed Comparison ◽  
Mordukhovich Stationarity ◽  
Stationarity Conditions ◽  
The One

Implicit variables of a mathematical program are variables which do not need to be optimized but are used to model feasibility conditions. They frequently appear in several different problem classes of optimization theory comprising bilevel programming, evaluated multiobjective optimization, or nonlinear optimization problems with slack variables. In order to deal with implicit variables, they are often interpreted as explicit ones. Here, we first point out that this is a light-headed approach which induces artificial locally optimal solutions. Afterwards, we derive various Mordukhovich-stationarity-type necessary optimality conditions which correspond to treating the implicit variables as explicit ones on the one hand, or using them only implicitly to model the constraints on the other. A detailed comparison of the obtained stationarity conditions as well as the associated underlying constraint qualifications will be provided. Overall, we proceed in a fairly general setting relying on modern tools of variational analysis. Finally, we apply our findings to different well-known problem classes of mathematical optimization in order to visualize the obtained theory. Comment: 34 pages

scholarly journals Calmness and Calculus: Two Basic Patterns

2021 ◽  
Author(s):  
Matúš Benko ◽  
Patrick Mehlitz
Keyword(s):  
Optimization Problems ◽  
Sufficient Conditions ◽  
Necessary Optimality Conditions ◽  
Generalized Derivatives ◽  
Minimax Optimization ◽  
Cartesian Products ◽  
Calculus Rules ◽  
Set Valued Mappings ◽  
The One ◽  
Derivatives Of

AbstractWe establish two types of estimates for generalized derivatives of set-valued mappings which carry the essence of two basic patterns observed throughout the pile of calculus rules. These estimates also illustrate the role of the essential assumptions that accompany these two patters, namely calmness on the one hand and (fuzzy) inner calmness* on the other. Afterwards, we study the relationship between and sufficient conditions for the various notions of (inner) calmness. The aforementioned estimates are applied in order to recover several prominent calculus rules for tangents and normals as well as generalized derivatives of marginal functions and compositions as well as Cartesian products of set-valued mappings under mild conditions. We believe that our enhanced approach puts the overall generalized calculus into some other light. Some applications of our findings are presented which exemplary address necessary optimality conditions for minimax optimization problems as well as the calculus related to the recently introduced semismoothness* property.

scholarly journals On a Class of Isoperimetric Constrained Controlled Optimization Problems

Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 112
Author(s):  
Savin Treanţă
Keyword(s):  
Boundary Conditions ◽  
Control Problem ◽  
Optimality Conditions ◽  
Optimization Problems ◽  
Necessary Optimality Conditions ◽  
Control Problems ◽  
Integral Functionals ◽  
Curvilinear Integral ◽  
The One ◽  
Theoretical Results

In this paper, we investigate the Lagrange dynamics generated by a class of isoperimetric constrained controlled optimization problems involving second-order partial derivatives and boundary conditions. More precisely, we derive necessary optimality conditions for the considered class of variational control problems governed by path-independent curvilinear integral functionals. Moreover, the theoretical results presented in the paper are accompanied by an illustrative example. Furthermore, an algorithm is proposed to emphasize the steps to be followed to solve a control problem such as the one studied in this paper.

scholarly journals Minimum Principle-Type Necessary Optimality Conditions in Scalar and Vector Optimization. An Account

2017 ◽  
Vol 9 (4) ◽  
pp. 168
Author(s):  
Giorgio Giorgi
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Optimization Problems ◽  
Minimum Principle ◽  
Necessary Optimality Conditions ◽  
Equality Constraints ◽  
Vector Optimization Problems ◽  
Scalar Optimization ◽  
Scalar And Vector Optimization

We take into condideration necessary optimality conditions of minimum principle-type, that is for optimization problems having, besides the usual inequality and/or equality constraints, a set constraint. The first part pf the paper is concerned with scalar optimization problems; the second part of the paper deals with vector optimization problems.

scholarly journals Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications

2021 ◽  
Vol Volume 2 (Original research articles>) ◽  
Author(s):  
Lisa C. Hegerhorst-Schultchen ◽  
Christian Kirches ◽  
Marc C. Steinbach
Keyword(s):  
Normal Form ◽  
Optimization Problems ◽  
Constraint Qualifications ◽  
Inequality Constraints ◽  
First Order ◽  
Nonlinear Programs ◽  
Mathematical Programs ◽  
Ongoing Effort ◽  
Equality And Inequality Constraints ◽  
Smooth Optimization

This work continues an ongoing effort to compare non-smooth optimization problems in abs-normal form to Mathematical Programs with Complementarity Constraints (MPCCs). We study general Nonlinear Programs with equality and inequality constraints in abs-normal form, so-called Abs-Normal NLPs, and their relation to equivalent MPCC reformulations. We introduce the concepts of Abadie's and Guignard's kink qualification and prove relations to MPCC-ACQ and MPCC-GCQ for the counterpart MPCC formulations. Due to non-uniqueness of a specific slack reformulation suggested in [10], the relations are non-trivial. It turns out that constraint qualifications of Abadie type are preserved. We also prove the weaker result that equivalence of Guginard's (and Abadie's) constraint qualifications for all branch problems hold, while the question of GCQ preservation remains open. Finally, we introduce M-stationarity and B-stationarity concepts for abs-normal NLPs and prove first order optimality conditions corresponding to MPCC counterpart formulations.

scholarly journals An Extensive Operational Law for Monotone Functions of LR Fuzzy Intervals with Applications to Fuzzy Optimization

2021 ◽  
Author(s):  
Mingxuan Zhao ◽  
Yulin Han ◽  
Jian Zhou
Keyword(s):  
Fuzzy Numbers ◽  
Optimization Problems ◽  
Fuzzy Optimization ◽  
Fuzzy Programming ◽  
Planning Problem ◽  
Monotone Functions ◽  
Solution Strategy ◽  
Deterministic Equivalent ◽  
The One ◽  
Short Time

Abstract The operational law put forward by Zhou et al. on strictly monotone functions with regard to regular LR fuzzy numbers makes a valuable push to the development of fuzzy set theory. However, its applicable conditions are confined to strictly monotone functions and regular LR fuzzy numbers, which restricts its application in practice to a certain degree. In this paper, we propose an extensive operational law that generalizes the one proposed by Zhou et al. to apply to monotone (but not necessarily strictly monotone) functions with regard to regular LR fuzzy intervals (LR-FIs), of which regular fuzzy numbers can be regarded as particular cases. By means of the extensive operational law, the inverse credibility distributions (ICDs) of monotone functions regarding regular LR-FIs can be calculated efficiently and effectively. Moreover, the extensive operational law has a wider range of applications, which can deal with the situations hard to be handled by the original operational law. Subsequently, based on the extensive operational law, the computational formulae for expected values (EVs) of LR-FIs and monotone functions with regard to regular LR-FIs are presented. Furthermore, the proposed operational law is also applied to dispose fuzzy optimization problems with regular LR-FIs, for which a solution strategy is provided, where the fuzzy programming is converted to a deterministic equivalent first and then a newly-devised solution algorithm is utilized. Finally, the proposed solution strategy is applied to a purchasing planning problem, whose performances are evaluated by comparing with the traditional fuzzy simulation-based genetic algorithm. Experimental results indicate that our method is much more efficient, yielding high-quality solutions within a short time.

Sign in / Sign up

Export Citation Format

Share Document