Search results for "Vector"
showing 10 items of 2660 documents
Surrogate-Assisted Evolutionary Optimization of Large Problems
2019
This chapter presents some recent advances in surrogate-assisted evolutionary optimization of large problems. By large problems, we mean either the number of decision variables is large, or the number of objectives is large, or both. These problems pose challenges to evolutionary algorithms themselves, constructing surrogates and surrogate management. To address these challenges, we proposed two algorithms, one called kriging-assisted reference vector guided evolutionary algorithm (K-RVEA) for many-objective optimization, and the other called cooperative swarm optimization algorithm (SA-COSO) for high-dimensional single-objective optimization. Empirical studies demonstrate that K-RVEA works…
Least-Norm Regularization For Weak Two-Level Optimization Problems
1992
In this paper, we consider a regularization for weak two-level optimization problems by adaptation of the method presented by Solohovic (1970). Existence and approximation results are given in the case in which the constraints to the lower level problems are described by a multifunction. Convergence results for the least-norm regularization under perturbations are also presented.
Sufficient conditions for coincidence in ℓ1 multifacility location problems
1997
We consider the problem of finding the optimal way of locating a finite number of facilities in a finite dimensional space, in order to minimize a weighted sum of the distances between these and other pre-existent facilities which are already positioned. We study the specific case where distance is measured in the @?"1, giving a new sufficient condition for identifying groups of facilities whose position will coincide at optimality.
Decision Making on Pareto Front Approximations with Inherent Nondominance
2011
t Approximating the Pareto fronts of nonlinear multiobjective optimization problems is considered and a property called inherent nondominance is proposed for such approximations. It is shown that an approximation having the above property can be explored by interactively solving a multiobjective optimization problem related to it. This exploration can be performed with available interactive multiobjective optimization methods. The ideas presented are especially useful in solving computationally expensive multiobjective optimization problems with costly function value evaluations. peerReviewed
Efficient Pruning LMI Conditions for Branch-and-Prune Rank and Chirality-Constrained Estimation of the Dual Absolute Quadric
2014
International audience; We present a new globally optimal algorithm for self- calibrating a moving camera with constant parameters. Our method aims at estimating the Dual Absolute Quadric (DAQ) under the rank-3 and, optionally, camera centers chirality constraints. We employ the Branch-and-Prune paradigm and explore the space of only 5 parameters. Pruning in our method relies on solving Linear Matrix Inequality (LMI) feasibility and Generalized Eigenvalue (GEV) problems that solely depend upon the entries of the DAQ. These LMI and GEV problems are used to rule out branches in the search tree in which a quadric not satisfy- ing the rank and chirality conditions on camera centers is guarantee…
Multiple-Choice Balanced Allocation in (Almost) Parallel
2012
We consider the problem of resource allocation in a parallel environment where new incoming resources are arriving online in groups or batches.
TOWARD A SOLUTION OF ALLOCATION IN LIFE CYCLE INVENTORIES: THE USE OF LEAST SQUARES TECHNIQUES
2010
Purpose: The matrix method for the solution of the so-called inventory problem in LCA generally determines the inventory vector related to a specific system of processes by solving a system of linear equations. The paper proposes a new approach to deal with systems characterized by a rectangular (and thus non-invertible) coefficients matrix. The approach, based on the application of regression techniques, allows solving the system without using computational expedients such as the allocation procedure. Methods: The regression techniques used in the paper are (besides the ordinary least squares, OLS) total least squares (TLS) and data least squares (DLS). In this paper, the authors present t…
The Power of the “Pursuit” Learning Paradigm in the Partitioning of Data
2019
Traditional Learning Automata (LA) work with the understanding that the actions are chosen purely based on the “state” in which the machine is. This modus operandus completely ignores any estimation of the Random Environment’s (RE’s) (specified as \(\mathbb {E}\)) reward/penalty probabilities. To take these into consideration, Estimator/Pursuit LA utilize “cheap” estimates of the Environment’s reward probabilities to make them converge by an order of magnitude faster. This concept is quite simply the following: Inexpensive estimates of the reward probabilities can be used to rank the actions. Thereafter, when the action probability vector has to be updated, it is done not on the basis of th…
Necessary conditions for extremality and separation theorems with applications to multiobjective optimization
1998
The aim of this paper is to give necessary conditions for extremality in terms of an abstract subdifferential and to obtain general separation theorems including both finite and infinite classical separation theorems. This approach, which is mainly based on Ekeland's variational principle and the concept of locally weak-star compact cones, can be considered as a generalization f the notions of optima in problems of scalar or vector optimization with and without constraints. The results obtained are applied to derive new necessary optimality conditions for Pareto local minimum and weak Pareto minimum of nonsmooth multlobjectivep rogramming problems.
ε-Regularized two-level optimization problems: Approximation and existence results
2006
The purpose of this work is to improve some results given in [12], relating to approximate solutions for two-level optimization problems. By considering an e-regularized problem, we get new properties, under convexity assumptions in the lower level problems. In particular, we prove existence results for the solutions to the e-regularized problem, whereas the initial two-level optimization problem may fail to have a solution. Finally, as an example, we consider an approximation method with interior penalty functions.