Results 21 to 30 of about 1,159 (105)
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
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace [PDF]
, 2005 We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere.
Barvinok, Alexander
core +4 more sources
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Open Mathematics, 2017 This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong +3 more
doaj +1 more source
No-Free-Lunch Theorems in the continuum [PDF]
, 2014 No-Free-Lunch Theorems state, roughly speaking, that the performance of all search algorithms is the same when averaged over all possible objective functions.
Alabert, Aureli +3 more
core +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 parametric linearizing approach for quadratically inequality constrained quadratic programs
Open Mathematics, 2018 In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated ...
Jiao Hongwei, Chen Rongjiang
doaj +1 more source
Open Mathematics, 2017 Nowadays, nature–inspired metaheuristic algorithms are most powerful optimizing algorithms for solving the NP–complete problems. This paper proposes three approaches to find near–optimal Golomb ruler sequences based on nature–inspired algorithms in a ...
Bansal Shonak +2 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
Open Mathematics, 2018 In this paper, we present an effective algorithm for globally solving quadratic programs with quadratic constraints, which has wide application in engineering design, engineering optimization, route optimization, etc.
Tang Shuai, Chen Yuzhen, Guo Yunrui
doaj +1 more source
The Convex Relaxation Method on Deconvolution Model withMultiplicative Noise
, 2013 In this paper, we consider variational approaches to handle the multiplica- tive noise removal and deblurring problem. Based on rather reasonable physical blurring-noisy assumptions, we derive a new variational model for this issue.
Yu-Mei Huang, M. Ng, T. Zeng
semanticscholar +1 more source