Results 11 to 20 of about 182 (91)
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 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
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
Global resolution of the support vector machine regression parameters selection problem with LPCC
EURO Journal on Computational Optimization, 2015 Support vector machine regression is a robust data fitting method to minimize the sum of deducted residuals of regression, and thus is less sensitive to changes of data near the regression hyperplane. Two design parameters, the insensitive tube size (εe)
Yu-Ching Lee +2 more
doaj +1 more source
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +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
Optimality conditions for pessimistic semivectorial bilevel programming problems
, 2014 In this paper, a class of pessimistic semivectorial bilevel programming problems is investigated. By using the scalarization method, we transform the pessimistic semivectorial bilevel programming problem into a scalar objective optimization problem with ...
Bingbing Liu +3 more
semanticscholar +1 more source
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
EURO Journal on Computational Optimization, 2021 Bilevel optimization is a field of mathematical programming in which some variables are constrained to be the solution of another optimization problem. As a consequence, bilevel optimization is able to model hierarchical decision processes.
Thomas Kleinert +3 more
doaj +1 more source
On interval-valued optimization problems with generalized invex functions
, 2013 This paper is devoted to study interval-valued optimization problems. Sufficient optimality conditions are established for LU optimal solution concept under generalized (p,r)−ρ−(η,θ)-invexity.
I. Ahmad +2 more
semanticscholar +1 more source
Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
Open Mathematics, 2019 A new class of generalized convex set-valued maps termed relatively solid generalized cone-subconvexlike maps is introduced in real linear spaces not equipped with any topology.
Liang Hongwei, Wan Zhongping
doaj +1 more source