25 research outputs found
Duality in mathematical programming.
In this thesis entitled, âDuality in Mathematical Programmingâ, the emphasis is given on formulation and conceptualization of the concepts of second-order duality, second-order mixed duality, second-order symmetric duality in a variety of nondifferentiable nonlinear programming under suitable second-order convexity/second-order invexity and generalized second-order convexity / generalized second-order invexity. Throughout the thesis nondifferentiablity occurs due to square root function and support functions. A support function which is more general than square root of a positive definite quadratic form. This thesis also addresses second-order duality in variational problems under suitable second-order invexity/secondorder generalized invexity. The duality results obtained for the variational problems are shown to be a dynamic generalization for thesis of nonlinear programming problem.Digital copy of Thesis.University of Kashmir
Some Aspects Of Duality In Variational Problems And Optimal Control
This thesis is divided into six chapters. In the Ist chapter we present a brief survey of related work done in the area of multiobjective mathematical programming, optimal control and game theory.
Chapter Two: In this chapter sufficient optimality criteria are derived for a control problem under generalized invexity. A Mond-Weir type dual to the control problem is proposed and various duality theorems are validated under generalized invexity assumptions on functionals appearing in the problems. It is pointed out that these results can be applied to the control problem with free boundary conditions and have linkage with results for nonlinear programming problems in the presence of inequality and equality constraints already established in the literature.
Chapter Three: In this chapter a mixed type dual to the control problem in order to unify Wolfe and Mond-Weir type dual control problem is presented in various duality results are validated and the generalized invexity assumptions. It is pointed out that our results can be extended to the control problems with free boundary conditions. The duality results for nonlinear programming problems already existing in the literature are deduced as special cases of our results.
Chapter Four: In this chapter two types of duals are considered for a class of variational problems involving higher order derivative. The duality results are derived without any use of optimality conditions. One set of results is based on Mond-Weir type dual that has the same objective functional as the primal problem but different constraints. The second set of results is based on a dual of an auxiliary primal with single objective function. Under various convexity and generalized convexity assumptions, duality relationships between primal and its various duals are established. Problems with natural boundary values are considered and the analogues of our results in nonlinear programming are also indicated. Chapter Five: In this chapter a certain constrained dynamic game is shown to be equivalent to a pair of symmetric dual variational problems which have more general formulation than those already existing in the literature. Various duality results are proved under convexity and generalized convexity assumptions on the appropriate functional. The dynamic game is also viewed as equivalent to a pair of dual variational problems without the condition of fixed points. It is also indicated that our equivalent formulation of a pair of symmetric dual variational problems as dynamic generalization of those already studied in the literature.
Chapter Six: In this chapter a mixed type second-order dual to a variational problem is formulated as a unification of Wolfe and Mond-Weir type dual problems already treated in the literature and various duality results are validated under generalized second order invexity. Problems with natural boundary values are formulated and it also is pointed out that our duality results can be regarded as dynamic generalizations of those of (static) nonlinear programming.
The subject matter of the present research thesis is fully published in the form of the following research papers written by the author:
(1) Sufficiency and Duality In Control Problems with Generalized Invexity, Journal of Applied Analysis,Vol, 14 No. 1 (2008),pp.27-42.
(2) Mixed Type Duality for Control Problems with Generalized Invexity, Journal of Applied Mathematics and Informatics,Vol. 26(2008), No.5-6 , pp. 819-837.
(3) On Multiobjective Duality for Variational Problems, The Open Operational Research
Journal,2012, 6, 1-8.
(4) Constrained Dynamic Game and Symmetric Duality For Variational Problems, Journal
of Mathematics and System Science 2(2012), 171-178.
(5) Mixed Type Second â Order Dulaity For Variational Problems, Journal of Informatics
and Mathematical Sciences , Vol5,No.1, pp.1-13,(2013)
Global Optimisation for Energy System
The goal of global optimisation is to find globally optimal solutions, avoiding local optima and other stationary points. The aim of this thesis is to provide more efficient global optimisation tools for energy systems planning and operation. Due to the ongoing increasing of complexity and decentralisation of power systems, the use of advanced mathematical techniques that produce reliable solutions becomes necessary. The task of developing such methods is complicated by the fact that most energy-related problems are nonconvex due to the nonlinear Alternating Current Power Flow equations and the existence of discrete elements. In some cases, the computational challenges arising from the presence of non-convexities can be tackled by relaxing the definition of convexity and identifying classes of problems that can be solved to global optimality by polynomial time algorithms. One such property is known as invexity and is defined by every stationary point of a problem being a global optimum. This thesis investigates how the relation between the objective function and the structure of the feasible set is connected to invexity and presents necessary conditions for invexity in the general case and necessary and sufficient conditions for problems with two degrees of freedom. However, nonconvex problems often do not possess any provable convenient properties, and specialised methods are necessary for providing global optimality guarantees. A widely used technique is solving convex relaxations in order to find a bound on the optimal solution. Semidefinite Programming relaxations can provide good quality bounds, but they suffer from a lack of scalability. We tackle this issue by proposing an algorithm that combines decomposition and linearisation approaches. In addition to continuous non-convexities, many problems in Energy Systems model discrete decisions and are expressed as mixed-integer nonlinear programs (MINLPs). The formulation of a MINLP is of significant importance since it affects the quality of dual bounds. In this thesis we investigate algebraic characterisations of on/off constraints and develop a strengthened version of the Quadratic Convex relaxation of the Optimal Transmission Switching problem. All presented methods were implemented in mathematical modelling and optimisation frameworks PowerTools and Gravity
Some contributions to optimality criteria and duality in Multiobjective mathematical programming.
This thesis entitled, âsome contributions to optimality criteria and duality in multiobjective mathematical programmingâ, offers an extensive study on optimality, duality and mixed duality in a variety of multiobjective mathematical programming that includes nondifferentiable nonlinear programming, variational problems containing square roots of a certain quadratic forms and support functions which are prominent nondifferentiable convex functions. This thesis also deals with optimality, duality and mixed duality for differentiable and nondifferentiable variational problems involving higher order derivatives, and presents a close relationship between the results of continuous programming problems through the problems with natural boundary conditions between results of their counter parts in nonlinear programming. Finally it formulates a pair of mixed symmetric and self dual differentiable variational problems and gives the validation of various duality results under appropriate invexity and generalized invexity hypotheses. These results are further extended to a nondifferentiable case that involves support functions.Digital copy of Thesis.University of Kashmir
Symbolic approaches and artificial intelligence algorithms for solving multi-objective optimisation problems
Problems that have more than one objective function are of great importance in engineering sciences and many other disciplines. This class of problems are known as multi-objective optimisation problems (or multicriteria). The difficulty here lies in the conflict between the various objective functions. Due to this conflict, one cannot find a single ideal solution which simultaneously satisfies all the objectives. But instead one can find the set of Pareto-optimal solutions (Pareto-optimal set) and consequently the Pareto-optimal front is established. Finding these solutions plays an important role in multi-objective optimisation problems and mathematically the problem is considered to be solved when the Pareto-optimal set, i.e. the set of all compromise solutions is found. The Pareto-optimal set may contain information that can help the designer make a decision and thus arrive at better trade-off solutions. The aim of this research is to develop new multi-objective optimisation symbolic algorithms capable of detecting relationship(s) among decision variables that can be used for constructing the analytical formula of Pareto-optimal front based on the extension of the current optimality conditions. A literature survey of theoretical and evolutionary computation techniques for handling multiple objectives, constraints and variable interaction highlights a lack of techniques to handle variable interaction. This research, therefore, focuses on the development of techniques for detecting the relationships between the decision variables (variable interaction) in the presence of multiple objectives and constraints. It attempts to fill the gap in this research by formally extending the theoretical results (optimality conditions). The research then proposes first-order multi-objective symbolic algorithm or MOSA-I and second-order multi-objective symbolic algorithm or MOSA-II that are capable of detecting the variable interaction. The performance of these algorithms is analysed and compared to a current state-of-the-art optimisation algorithm using popular test problems. The performance of the MOSA-II algorithm is finally validated using three appropriately chosen problems from literature. In this way, this research proposes a fully tested and validated methodology for dealing with multi-objective optimisation problems. In conclusion, this research proposes two new symbolic algorithms that are used for identifying the variable interaction responsible for constructing Pareto-optimal front among objectives in multi-objective optimisation problems. This is completed based on a development and relaxation of the first and second-order optimality conditions of Karush-Kuhn-Tucker.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
Efficient Output Kernel Learning for Multiple Tasks
The paradigm of multi-task learning is that one can achieve better
generalization by learning tasks jointly and thus exploiting the similarity
between the tasks rather than learning them independently of each other. While
previously the relationship between tasks had to be user-defined in the form of
an output kernel, recent approaches jointly learn the tasks and the output
kernel. As the output kernel is a positive semidefinite matrix, the resulting
optimization problems are not scalable in the number of tasks as an
eigendecomposition is required in each step. \mbox{Using} the theory of
positive semidefinite kernels we show in this paper that for a certain class of
regularizers on the output kernel, the constraint of being positive
semidefinite can be dropped as it is automatically satisfied for the relaxed
problem. This leads to an unconstrained dual problem which can be solved
efficiently. Experiments on several multi-task and multi-class data sets
illustrate the efficacy of our approach in terms of computational efficiency as
well as generalization performance
Well-Behavior, Well-Posedness and Nonsmooth Analysis
AMS subject classification: 90C30, 90C33.We survey the relationships between well-posedness and well-behavior. The latter
notion means that any critical sequence (xn) of a lower semicontinuous function
f on a Banach space is minimizing. Here âcriticalâ means that the remoteness of
the subdifferential âf(xn) of f at xn (i.e. the distance of 0 to âf(xn)) converges
to 0. The objective function f is not supposed to be convex or smooth and the
subdifferential â is not necessarily the usual Fenchel subdifferential. We are thus
led to deal with conditions ensuring that a growth property of the subdifferential
(or the derivative) of a function implies a growth property of the function itself.
Both qualitative questions and quantitative results are considered