scholarly journals Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces

1994 ◽  
Vol 50 (2) ◽  
pp. 205-218 ◽  
Author(s):  
L. Coladas ◽  
Z. Li ◽  
S. Wang
Keyword(s):  
Optimality Conditions ◽  
Efficient Solution ◽  
Feasible Solution ◽  
Sufficient Conditions ◽  
Multiobjective Optimisation ◽  
Weak Minimum ◽  
Abstract Spaces

In this paper we study optimality conditions for an efficient solution in various senses of a general multiobjective optimisation problem in abstract spaces. We utilise properties of the Clarke's generalised differential and properties of a conesubconvexlike function to derive a few necessary and/or sufficient conditions for a feasible solution to be a weak minimum (a minimum, a strong minimum or a proper minimum) of the vector optimisation problem. The results in this paper are extensions and refinements of some known results in vector optimisation.

scholarly journals Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
D. Barilla ◽  
G. Caristi ◽  
A. Puglisi
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Efficient Solution ◽  
Necessary Conditions ◽  
Constraint Qualifications ◽  
Sufficient Conditions ◽  
Inequality Constraints ◽  
Necessary Condition ◽  
Weak Assumption ◽  
Infinite Programming

We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and strong Karush-Kuhn-Tucker (KKT in brief) types necessary conditions for an efficient solution of the considered problem. Finally an extension of a Caristi-Ferrara-Stefanescu result for the (Φ,ρ)-invexity is proved, and some sufficient conditions are presented under this weak assumption. All results are given in terms of Clark subdifferential.

scholarly journals Continuous programming containing arbitrary norms

1985 ◽  
Vol 39 (1) ◽  
pp. 28-38 ◽  
Author(s):  
S. Chandra ◽  
B. D. Craven ◽  
I. Husain
Keyword(s):  
Mathematical Programming ◽  
Constrained Optimization ◽  
Optimality Conditions ◽  
Duality Result ◽  
Duality Results ◽  
Continuous Programming ◽  
Arbitrary Norms ◽  
Abstract Spaces ◽  
Special Case

AbstractOptimality conditions and duality results are obtained for a class of cone constrained continuous programming problems having terms with arbitrary norms in the objective and constraint functions. The proofs are based on a Fritz John theorem for constrained optimization in abstract spaces. Duality results for a fractional analogue of such continuous programming problems are indicated and a nondifferentiable mathematical programming duality result, not explicitly reported in the literature, is deduced as a special case.

Painlevé–Kuratowski Convergence of Solutions for Perturbed Symmetric Set-Valued Quasi-Equilibrium Problem via Improvement Sets

2020 ◽  
Vol 37 (04) ◽  
pp. 2040003
Author(s):  
Zai-Yun Peng ◽  
Jing-Jing Wang ◽  
Xian-Jun Long ◽  
Fu-Ping Liu
Keyword(s):  
Efficient Solution ◽  
Sufficient Conditions ◽  
Quasi Equilibrium ◽  
Nonlinear Scalarization ◽  
Solution Sets ◽  
Improvement Sets ◽  
Oriented Distance ◽  
Kuratowski Convergence ◽  
Symmetric Set ◽  
Convergence Of Solution

This paper is devoted to study the Painlevé–Kuratowski convergence of solution sets for perturbed symmetric set-valued quasi-equilibrium problems (SSQEP)[Formula: see text] via improvement sets. By virtue of the oriented distance function, the sufficient conditions of Painlevé–Kuratowski convergence of efficient solution sets for (SSQEP)[Formula: see text] are obtained through a new nonlinear scalarization technical. Then, under [Formula: see text]-convergence of set-valued mappings, the Painlevé–Kuratowski convergence of weak efficient solution sets for (SSQEP)[Formula: see text] is discussed. What’s more, with suitable convergence assumptions, we also establish the sufficient conditions of lower Painlevé–Kuratowski convergence of Borwein proper efficient solution sets for (SSQEP)[Formula: see text] under improvement sets. Some interesting examples are formulated to illustrate the significance of the main results.

scholarly journals Error Bounds and Finite Termination for Constrained Optimization Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Wenling Zhao ◽  
Daojin Song ◽  
Bingzhuang Liu
Keyword(s):  
Constrained Optimization ◽  
Error Bound ◽  
Feasible Solution ◽  
Optimization Problems ◽  
Sufficient Conditions ◽  
Merit Function ◽  
Global Error Bound ◽  
Constrained Optimization Problems ◽  
Nonconvex Constrained Optimization ◽  
Necessary And Sufficient

We present a global error bound for the projected gradient of nonconvex constrained optimization problems and a local error bound for the distance from a feasible solution to the optimal solution set of convex constrained optimization problems, by using the merit function involved in the sequential quadratic programming (SQP) method. For the solution sets (stationary points set andKKTpoints set) of nonconvex constrained optimization problems, we establish the definitions of generalized nondegeneration and generalized weak sharp minima. Based on the above, the necessary and sufficient conditions for a feasible solution of the nonconvex constrained optimization problems to terminate finitely at the two solutions are given, respectively. Accordingly, the results in this paper improve and popularize existing results known in the literature. Further, we utilize the global error bound for the projected gradient with the merit function being computed easily to describe these necessary and sufficient conditions.

scholarly journals Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization

Filomat ◽  
2017 ◽  
Vol 31 (3) ◽  
pp. 671-680 ◽  
Author(s):  
Mehrdad Ghaznavi
Keyword(s):  
Multiobjective Optimization ◽  
Optimality Conditions ◽  
Optimization Problem ◽  
Original Problem ◽  
Necessary Conditions ◽  
Sufficient Conditions ◽  
Multiobjective Optimization Problem ◽  
Alternative Theorem ◽  
Convexity Assumptions ◽  
Interesting Area

Approximate problems that scalarize and approximate a given multiobjective optimization problem (MOP) became an important and interesting area of research, given that, in general, are simpler and have weaker existence requirements than the original problem. Recently, necessary conditions for approximation of several types of efficiency for MOPs have been obtained through the use of an alternative theorem. In this paper, we use these results in order to extend them to sufficient conditions for approximate quasi (weak, proper) efficiency. For this, we use two scalarization techniques of Tchebycheff type. All the provided results are established without convexity assumptions.

scholarly journals Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Wenyan Han ◽  
Guolin Yu ◽  
Tiantian Gong
Keyword(s):  
Optimality Conditions ◽  
Generalized Convexity ◽  
Multiobjective Programming ◽  
Necessary Conditions ◽  
Sufficient Conditions ◽  
Efficient Solutions ◽  
Type I ◽  
Generalized Convex Functions ◽  
Alternative Theorem ◽  
Multiobjective Programming Problem

This note is devoted to the investigation of optimality conditions for robust approximate quasi weak efficient solutions to a nonsmooth uncertain multiobjective programming problem (NUMP). Firstly, under the extended nonsmooth Mangasarian–Fromovitz constrained qualification assumption, the optimality necessary conditions of robust approximate quasi weak efficient solutions are given by using an alternative theorem. Secondly, a class of generalized convex functions is introduced to the problem (NUMP), which is called the pseudoquasi-type-I function, and its existence is illustrated by a concrete example. Finally, under the pseudopseudo-type-I generalized convexity hypothesis, the optimality sufficient conditions for robust approximate quasi weak efficient solutions to the problem (NUMP) are established.

scholarly journals Using necessary optimality conditions for acceleration of the nonuniform covering optimization method

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Yury Evtushenko ◽  
Mikhail Posypkin
Keyword(s):  
Optimality Conditions ◽  
Optimization Problem ◽  
Feasible Solution ◽  
Necessary Optimality Conditions ◽  
Optimization Method ◽  
Upper And Lower Bounds ◽  
Test Problems ◽  
Covering Method ◽  
Computer Resources ◽  
Uniform Covering

Abstract Paper deals with the non-uniform covering method that is aimed at deterministic global optimization. This method finds a feasible solution to the optimization problem numerically and proves that the obtained solution differs from the optimal by no more than a given accuracy. Numerical proof consists of constructing a set of covering sets - the coverage. The number of elements in the coverage can be very large and even exceed the total amount of available computer resources. Basic method of coverage construction is the comparison of upper and lower bounds on the value of the objective function. In this work we propose to use necessary optimality conditions of first and second order for reducing the search for boxconstrained problems. We provide the algorithm description and prove its correctness. The efficiency of the proposed approach is studied on test problems.

scholarly journals Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
Xiaomei Zhang ◽  
Yanjun Wang ◽  
Weimin Ma
Keyword(s):  
Optimality Conditions ◽  
Minimization Problem ◽  
Sufficient Conditions ◽  
Sufficient Optimality Conditions ◽  
Global Optimality ◽  
Global Optimality Conditions ◽  
Box Constraints ◽  
Global Minimizers ◽  
Quadratic Minimization ◽  
Binary Constraints

We present some sufficient global optimality conditions for a special cubic minimization problem with box constraints or binary constraints by extending the global subdifferential approach proposed by V. Jeyakumar et al. (2006). The present conditions generalize the results developed in the work of V. Jeyakumar et al. where a quadratic minimization problem with box constraints or binary constraints was considered. In addition, a special diagonal matrix is constructed, which is used to provide a convenient method for justifying the proposed sufficient conditions. Then, the reformulation of the sufficient conditions follows. It is worth noting that this reformulation is also applicable to the quadratic minimization problem with box or binary constraints considered in the works of V. Jeyakumar et al. (2006) and Y. Wang et al. (2010). Finally some examples demonstrate that our optimality conditions can effectively be used for identifying global minimizers of the certain nonconvex cubic minimization problem.

scholarly journals Optimality and duality without a constraint qualification for minimax programming

2003 ◽  
Vol 67 (1) ◽  
pp. 121-130 ◽  
Author(s):  
Houchun Zhou ◽  
Wenyu Sun
Keyword(s):  
Optimality Conditions ◽  
Constraint Qualification ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Dual Model ◽  
Duality Theorems ◽  
Minimax Programming ◽  
Optimality And Duality ◽  
Necessary And Sufficient

Without the need of a constraint qualification, we establish the optimality necessary and sufficient conditions for generalised minimax programming. Using these optimality conditions, we construct a parametric dual model and a parameter-free mixed dual model. Several duality theorems are established.

Sign in / Sign up

Export Citation Format

Share Document