Results 11 to 20 of about 76,322 (245)
A HYBRID DIFFERENTIAL EVOLUTION FOR NON-SMOOTH OPTIMIZATION PROBLEMS
Solving high dimentional, multimodal, non-smooth global optimization problems faces challenges concerning quality of solution, computational costs or even the impossibility of solving the problem. Evolutionary algorithms, in particular, differential evolution algorithm proved itself as good method of global optimization.
Lyudmila D. Egorova +4 more
openaire +2 more sources
Support vector machine (SVM) is a new machine learning method developed from statistical learning theory. Since the objective function of the unconstrained SVM model is a non-smooth function, a lot of fast optimization algorithms can't be used to find ...
Jianjian Wang, Feng He, Shouheng Sun
doaj +2 more sources
Finding Global Minima with a Filled Function Approach for Non-Smooth Global Optimization
A filled function approach is proposed for solving a non-smooth unconstrained global optimization problem. First, the definition of filled function in Zhang (2009) for smooth global optimization is extended to non-smooth case and a new one is put ...
Weixiang Wang, Youlin Shang, Ying Zhang
doaj +1 more source
The Non-Smooth and Bi-Objective Team Orienteering Problem with Soft Constraints
In the classical team orienteering problem (TOP), a fixed fleet of vehicles is employed, each of them with a limited driving range. The manager has to decide about the subset of customers to visit, as well as the visiting order (routes).
Alejandro Estrada-Moreno +4 more
doaj +1 more source
Underwater Image Restoration via Non-Convex Non-Smooth Variation and Thermal Exchange Optimization
The quality of underwater images is an important problem for resource detection. However, the light scattering and plankton in water can impact the quality of underwater images. In this paper, a novel underwater image restoration based on non-convex, non-
Qingliang Jiao +6 more
doaj +1 more source
On some stochastic mirror descent methods for constrained online optimization problems [PDF]
The problem of online convex optimization naturally occurs in cases when there is an update of statistical information. The mirror descent method is well known for non-smooth optimization problems. Mirror descent is an extension of the subgradient method
Mohammad S. Alkousa
doaj +1 more source
Continuous time non-smooth optimization through quasi efficiency
Abstract The importance of quasi efficiency lies in its versatile nature as it permits a definite tolerable error that depend on the decision variables. This has been a motivating factor for us to introduce the notion of quasi e cient solution for the non-smooth multiobjective continuous time programming problem.
Kumar, Promila, Sharma, Bharti
openaire +1 more source
Envelope theorems for non-smooth and non-concave optimization [PDF]
We study general dynamic programming problems with continuous and discrete choices and general constraints. The value functions may have kinks arising (1) at indifference points between discrete choices and (2) at constraint boundaries. Nevertheless, we establish a general envelope theorem: first-order conditions are necessary at interior optimal ...
Clausen, Andrew, Strub, Carlo
openaire +4 more sources
Antlion optimization algorithm for optimal non-smooth economic load dispatch
This paper presents applications of Antlion optimization algorithm (ALO) for handling optimal economic load dispatch (OELD) problems. Electricity generation cost minimization by controlling power output of all available generating units is a major goal of the problem. ALO is a metaheuristic algorithm based on the hunting process of Antlions. The effect
Thanh Pham Van +2 more
openaire +2 more sources
The state-of-the-art accelerometer technology has been widely applied in space missions. The performance of the next generation accelerometer in future geodesic satellites is pushed to 8 × 10 − 13 m / s 2 / H z 1 / 2 , which is ...
Hongyin Li +4 more
doaj +1 more source

