Solving discrete zero point problems with vector labeling [PDF]
, 2005 AMS classifications: 47H10; 54H25; 55M20; 90C26; 90C33; 91B50;
Laan, G. van der +2 more
core +6 more sources
Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
Open Mathematics, 2019 This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj +1 more source
An elementary approach to polynomial optimization on polynomial meshes [PDF]
, 2018 A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for polynomials whose norming constant is independent of degree.
Vianello, Marco
core +3 more sources
On the convergence of min/sup points in optimal control problems
Abstract and Applied Analysis, Volume 6, Issue 1, Page 35-52, 2001., 2001 We modify the definition of lopsided convergence of bivariate functionals to obtain stability results for the min/sup points of some control problems. In particular, we develop a scheme of finite dimensional approximations to a large class of non‐convex control problems.
Adib Bagh
wiley +1 more source
A reduced space branch and bound algorithm for a class of sum of ratios problems
Open Mathematics, 2018 Sum of ratios problem occurs frequently in various areas of engineering practice and management science, but most solution methods for this kind of problem are often designed for determining local solutions .
Zhao Yingfeng, Zhao Ting
doaj +1 more source
A global method for some class of optimization and control problems
International Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 9, Page 605-616, 2000., 2000 The problem of maximizing a nonsmooth convex function over an arbitrary set is considered. Based on the optimality condition obtained by Strekalovsky in 1987 an algorithm for solving the problem is proposed. We show that the algorithm can be applied to the nonconvex optimal control problem as well.
R. Enkhbat
wiley +1 more source
Necessary and sufficient condition on global optimality without convexity and second order differentiability [PDF]
, 2012 The main goal of this paper is to give a necessary and sufficient condition of global optimality for unconstrained optimization problems, when the objective function is not necessarily convex. We use Gâteaux differentiability of the objective function
A. Brøndsted +9 more
core +1 more source
Global Solutions to Nonconvex Optimization of 4th-Order Polynomial and Log-Sum-Exp Functions [PDF]
, 2014 This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences.
Chen, Yi, Gao, David Y
core +1 more source
Optimizing condition numbers [PDF]
, 2009 In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Jane J. Ye, Lewis A.S., Pierre Maréchal
core +1 more source
Nonsmooth set variational inequality problems and optimality criteria for set optimization
, 2020 In this work, set-valued optimization problems are considered according to an order relation, which is a partial order on the family such that contains nonempty bounded sets of the space. A generalized convexity is defined for set-valued mapping by using
E. Karaman
semanticscholar +1 more source