Description:
A general nonlinear regularity model for a set-valued mapping F : X x R+ paired right arrows Y, where X and Y are metric spaces, is studied using special iteration procedures, going back to Banach, Schauder, Lyusternik, and Graves. Namely, we revise the induction theorem from Khanh [J. Math. Anal. Appl., 118 (1986), pp. 519-534] and employ it to obtain basic estimates for exploring regularity/openness properties. We also show that it can serve as a substitution for the Ekeland variational principle when establishing other regularity criteria. Then, we apply the induction theorem and the mentioned estimates to establish criteria for both global and local versions of regularity/openness properties for our model and demonstrate how the definitions and criteria translate into the conventional setting of a set-valued mapping F : X paired right arrows Y. An application to second-order necessary optimality conditions for a nonsmooth set-valued optimization problem with mixed constraints is provided.
Description:
A general nonlinear regularity model for a set-valued mapping F : X x R+ paired right arrows Y, where X and Y are metric spaces, is studied using special iteration procedures, going back to Banach, Schauder, Lyusternik, and Graves. Namely, we revise the induction theorem from Khanh [J. Math. Anal. Appl., 118 (1986), pp. 519-534] and employ it to obtain basic estimates for exploring regularity/openness properties. We also show that it can serve as a substitution for the Ekeland variational principle when establishing other regularity criteria. Then, we apply the induction theorem and the mentioned estimates to establish criteria for both global and local versions of regularity/openness properties for our model and demonstrate how the definitions and criteria translate into the conventional setting of a set-valued mapping F : X paired right arrows Y. An application to second-order necessary optimality conditions for a nonsmooth set-valued optimization problem with mixed constraints is provided.
Description:
In this paper, we establish a continuous selection theorem and use it to derive five equivalent results on the existence of fixed points, sectional points, maximal elements, intersection points and solutions of variational relations, all in topological settings without linear structures. Then, we study the solution existence of a number of optimization-related problems as examples of applications of these results: quasivariational inclusions, Stampacchia-type vector equilibrium problems, Nash equilibria, traffic networks, saddle points, constrained minimization, and abstract economies.
Description:
Purpose – One of the significant underlying principles of nanorobotic systems deals with the understanding and conceptualization of their respective complex nanocomponents. This paper introduces a new methodology to compute a set of optimal electronic and mathematical properties of Buckyball nanoparticle using graph algorithms based on dynamic programming and greedy algorithm. Design/methodology/approach – Buckyball, C60, is composed of sixty equivalent carbon atoms arranged as a highly symmetric hollow spherical cage in the form of a soccer ball. At first, Wiener, hyper-Wiener, Harary and reciprocal Wiener indices were computed using dynamic programming and presented them as: W(Buckyball)=11870.4, WW(Buckyball)=52570.9, Ha(Buckyball)=102.2 and RW(Buckyball)=346.9. The polynomials of Buckyball, Hosoya and hyper-Hosoya, which are in relationship with Buckyball's indices, have also been computed. The relationships between Buckyball's indices and polynomials were then computed and demonstrated a good agreement with their mathematical equations. Also, a graph algorithm based on greedy algorithms was used to find some optimal electronic aspects of Buckyball's structure by computing the Minimum Weight Spanning Tree (MWST) of Buckyball. Findings – The computed MWST was indicated that for connecting sixty carbon atoms of Buckyball together: the minimum numbers of double bonds were 30; the minimum numbers of single bonds were 29; and the minimum numbers of electrons were 178. These results also had good agreement with the principles of the authors' used greedy algorithm. Originality/value – This paper has used the graph algorithms for computing the optimal electronic and mathematical properties of BB. It has focused on mathematical properties of BB including Wiener, hyper-Wiener, Harary and reciprocal Wiener indices as well as Hosoya and Hyper-Hosoya polynomials and computerized them with dynamic programming graph algorithms.
Description:
The purpose of this paper is to propose a modified version of Failure Mode and Effects Analysis (FMEA) to alleviate its drawbacks. FMEA is an important tool in risk evaluation and finding the priority of potential failure modes for corrective actions. In the proposed method, the Universal Generating Function (UGF) approach has been used to improve the assessment capability of the conventional Risk Priority Number (RPN) in ranking. The new method is named as URPN. It generates the most number of unique values in comparison with the previous methods and considers relative importance for the parameters while it is easy to compute. More unique numbers help to avoid from having the same priority level for different failure modes which represent various risk levels. A case study has been employed to demonstrate that the URPN not only can improve the shortcomings but also is able to provide accurate values for risk assessment. Copyright (c) 2015 John Wiley & Sons, Ltd.
Description:
This study concentrates on optimizing a multi-state weighted k-out-of-n system consisting of different types of reparable components. An optimization model is developed to decide upon both optimal redundancy allocation and best maintenance activities for reliability allocation. The optimization model is to maximize system reliability and minimize system cost simultaneously. To reach this goal, a financial view has been employed to estimate the system reliability, and combine it with system cost. The proposed model determines the number of each component type in the system, and the maintenance actions and the time at which they should be applied. Also, the model is programmed by MATLAB, and Genetic Algorithm is used to solve a practical case. (C) 2016 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
Description:
Necessary and sufficient criteria for metric subregularity (or calmness) of set-valued mappings between general metric or Banach spaces are treated in the framework of the theory of error bounds for a special family of extended real-valued functions of two variables. A classification scheme for the general error bound and metric subregularity criteria is presented. The criteria are formulated in terms of several kinds of primal and subdifferential slopes.
Description:
Necessary and sufficient criteria for metric subregularity (or calmness) of set-valued mappings between general metric or Banach spaces are treated in the framework of the theory of error bounds for a special family of extended real-valued functions of two variables. A classification scheme for the general error bound and metric subregularity criteria is presented. The criteria are formulated in terms of several kinds of primal and subdifferential slopes.
Description:
The article presents a report on a wonderful tour in the area of stability analysis of linear (and not only linear) optimization undertaken in the last 15 years by the author and his team of collaborators. 15 years is a very short period for developing a mathematical theory. Nevertheless the scope of achievement presented in the article and the level of development of the theory are really impressive. The tour is full of attractions and the route is very carefully marked. Now the tour is on offer, and the author is eager to share its highlights with interested travelers.
Description:
The article presents a report on a wonderful tour in the area of stability analysis of linear (and not only linear) optimization undertaken in the last 15 years by the author and his team of collaborators. 15 years is a very short period for developing a mathematical theory. Nevertheless the scope of achievement presented in the article and the level of development of the theory are really impressive. The tour is full of attractions and the route is very carefully marked. Now the tour is on offer, and the author is eager to share its highlights with interested travelers.
Description:
For the classical nonlinear program, two new relaxations of the Mangasarian– Fromovitz constraint qualification are discussed and their relationship with some standard constraint qualifications is examined. In particular, we establish the equivalence of one of these constraint qualifications with the recently suggested by Andreani et al. Constant rank of the subspace component constraint qualification. As an application, we make use of this new constraint qualification in the local analysis of the solution map to a parameterized equilibrium problem, modeled by a generalized equation.
Description:
For the classical nonlinear program, two new relaxations of the Mangasarian– Fromovitz constraint qualification are discussed and their relationship with some standard constraint qualifications is examined. In particular, we establish the equivalence of one of these constraint qualifications with the recently suggested by Andreani et al. Constant rank of the subspace component constraint qualification. As an application, we make use of this new constraint qualification in the local analysis of the solution map to a parameterized equilibrium problem, modeled by a generalized equation.
Description:
Several primal and dual quantitative characterizations of regularity properties of collections of sets in normed linear spaces are discussed. Relationships between regularity properties of collections of sets and those of set-valued mappings are provided.
Description:
Several primal and dual quantitative characterizations of regularity properties of collections of sets in normed linear spaces are discussed. Relationships between regularity properties of collections of sets and those of set-valued mappings are provided.
Description:
We examine three primal space local Holder type regularity properties of finite collections of sets, namely, [q]-semiregularity, [q]-subregularity, and uniform [q]-regularity as well as their quantitative characterizations. Equivalent metric characterizations of the three mentioned regularity properties as well as a sufficient condition of [q]-subregularity in terms of Frechet normals are established. The relationships between [q]-regularity properties of collections of sets and the corresponding regularity properties of set-valued mappings are discussed.
Description:
We examine three primal space local Holder type regularity properties of finite collections of sets, namely, [q]-semiregularity, [q]-subregularity, and uniform [q]-regularity as well as their quantitative characterizations. Equivalent metric characterizations of the three mentioned regularity properties as well as a sufficient condition of [q]-subregularity in terms of Frechet normals are established. The relationships between [q]-regularity properties of collections of sets and the corresponding regularity properties of set-valued mappings are discussed. (C) 2014 Elsevier Inc. All rights reserved.
Description:
We examine three primal space local Holder type regularity properties of finite collections of sets, namely, [q]-semiregularity, [q]-subregularity, and uniform [q]-regularity as well as their quantitative characterizations. Equivalent metric characterizations of the three mentioned regularity properties as well as a sufficient condition of [q]-subregularity in terms of Frechet normals are established. The relationships between [q]-regularity properties of collections of sets and the corresponding regularity properties of set-valued mappings are discussed.
Description:
We examine three primal space local Holder type regularity properties of finite collections of sets, namely, [q]-semiregularity, [q]-subregularity, and uniform [q]-regularity as well as their quantitative characterizations. Equivalent metric characterizations of the three mentioned regularity properties as well as a sufficient condition of [q]-subregularity in terms of Frechet normals are established. The relationships between [q]-regularity properties of collections of sets and the corresponding regularity properties of set-valued mappings are discussed. (C) 2014 Elsevier Inc. All rights reserved.
Description:
In this article, we refine and slightly strengthen the metric space version of the Borwein-Preiss variational principle due to Li and Shi (2000) [12], clarify the assumptions and conclusions of their Theorem 1 as well as Theorem 2.5.2 in Borwein and Zhu (2005) [4] and streamline the proofs. Our main result, Theorem 3 is formulated in the metric space setting. When reduced to Banach spaces (Corollary 9), it extends and strengthens the smooth variational principle established in Borwein and Preiss (1987) [3] along several directions. (C) 2015 Elsevier Inc. All rights reserved.
Description:
In this article, we refine and slightly strengthen the metric space version of the Borwein-Preiss variational principle due to Li and Shi (2000) [12], clarify the assumptions and conclusions of their Theorem 1 as well as Theorem 2.5.2 in Borwein and Zhu (2005) [4] and streamline the proofs. Our main result, Theorem 3 is formulated in the metric space setting. When reduced to Banach spaces (Corollary 9), it extends and strengthens the smooth variational principle established in Borwein and Preiss (1987) [3] along several directions. (C) 2015 Elsevier Inc. All rights reserved.
Description:
This article continues the investigation of stationarity and regularity properties of infinite collections of sets in a Banach space started in Kruger and López (J. Optim. Theory Appl. 154(2), 2012), and is mainly focused on the application of the stationarity criteria to infinitely constrained optimization problems. We consider several settings of optimization problems which involve (explicitly or implicitly) infinite collections of sets and deduce for them necessary conditions characterizing stationarity in terms of dual space elements-normals and/or subdifferentials.
Description:
This article continues the investigation of stationarity and regularity properties of infinite collections of sets in a Banach space started in Kruger and López (J. Optim. Theory Appl. 154(2), 2012), and is mainly focused on the application of the stationarity criteria to infinitely constrained optimization problems. We consider several settings of optimization problems which involve (explicitly or implicitly) infinite collections of sets and deduce for them necessary conditions characterizing stationarity in terms of dual space elements-normals and/or subdifferentials.
Description:
In this article, we investigate nonlinear metric subregularity properties of set-valued mappings between general metric or Banach spaces. We demonstrate that these properties can be treated in the framework of the theory of (linear) error bounds for extended real-valued functions of two variables developed in Kruger (Error bounds and metric subregularity. Optimization 64(1):49-79, 2015). Several primal and dual space local quantitative and qualitative criteria of nonlinear metric subregularity are formulated. The relationships between the criteria are established and illustrated.
Description:
In this article, we investigate nonlinear metric subregularity properties of set-valued mappings between general metric or Banach spaces. We demonstrate that these properties can be treated in the framework of the theory of (linear) error bounds for extended real-valued functions of two variables developed in Kruger (Error bounds and metric subregularity. Optimization 64(1):49-79, 2015). Several primal and dual space local quantitative and qualitative criteria of nonlinear metric subregularity are formulated. The relationships between the criteria are established and illustrated.
Description:
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of regularities are presented which shed light on the relations between seemingly different ideas and point to possible necessary conditions for local linear convergence of fundamental algorithms
Description:
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of regularities are presented which shed light on the relations between seemingly different ideas and point to possible necessary conditions for local linear convergence of fundamental algorithms
Description:
This paper presents a canonical duality theory for solving a general nonconvex constrained optimization problem within a unified framework to cover Lagrange multiplier method and KKT theory. It is proved that if both target function and constraints possess certain patterns necessary for modeling real systems, a perfect dual problem (without duality gap) can be obtained in a unified form with global optimality conditions provided.While the popular augmented Lagrangian method may produce more difficult nonconvex problems due to the nonlinearity of constraints. Some fundamental concepts such as the objectivity and Lagrangian in nonlinear programming are addressed.
Description:
This paper presents a canonical duality theory for solving a general nonconvex constrained optimization problem within a unified framework to cover Lagrange multiplier method and KKT theory. It is proved that if both target function and constraints possess certain patterns necessary for modeling real systems, a perfect dual problem (without duality gap) can be obtained in a unified form with global optimality conditions provided.While the popular augmented Lagrangian method may produce more difficult nonconvex problems due to the nonlinearity of constraints. Some fundamental concepts such as the objectivity and Lagrangian in nonlinear programming are addressed.