Discrete, Nonlinear Approximation Problems in Polyhedral Norms. A Levenberg-Like Algorithm.
Distancias elipsoidales y puntos eficientes. Un método interactivo.
En este trabajo se estudian las propiedades que relacionan las distancias elipsoidales con la generación de puntos eficientes de un problema de programación multiobjetivo. Basándonos en estas propiedades, hemos construido un algoritmo interactivo convergente.
Domain optimization in -axisymmetric elliptic problems by dual finite element method
An axisymmetric second order elliptic problem with mixed boundary conditions is considered. The shape of the domain has to be found so as to minimize a cost functional, which is given in terms of the cogradient of the solution. A new dual finite element method is used for approximate solutions. The existence of an optimal domain is proven and a convergence analysis presented.
Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation
Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation
The paper describes the dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation. Two cases are analyzed in detail, differring in linear dependence of gradients of the active functions. The complete algorithm of the dual method is presented and its finite step convergence is proved.
Effects of ordering and updating techniques on the performance of the Karmarkar algorithm
Efficient trust region method for nonlinear least squares
Ein Verfahren zum Minimieren einer Funktion bei eingeschränktem Variationsbereich der Parameter.
Empirical regression quantile processes
We address the problem of estimating quantile-based statistical functionals, when the measured or controlled entities depend on exogenous variables which are not under our control. As a suitable tool we propose the empirical process of the average regression quantiles. It partially masks the effect of covariates and has other properties convenient for applications, e.g. for coherent risk measures of various types in the situations with covariates.
Équations linéaires dans les anneaux de polynômes
Errata ao artigo "Um algoritmo exacto para o problema da p-mediana" (Port. Math., 42(2) (1983-1984), 151-162)
Error Estimates for the Finite Element Solution of Variational Inequalities. Part I. Primal Theory.
Estudio computacional de algunos nuevos algoritmos heurísticos para el problema de planificación de proyectos con limitación de recursos.
El trabajo describe dos métodos de diseño de algoritmos heurísticos para el problema de planificación de un proyecto con limitación de recursos. El primer método es constructivo: las actividades del proyecto se intentan incorporar a la secuencia posible tan pronto como lo permiten sus relaciones de precedencia, resolviendo de diversas formas los conflictos provocados por la limitación de recursos. El segundo enfoque está basado en la idea de incorporar arcos disjuntos para resolver las incompatibilidades...
Evaluation of Clarke's generalized gradient in optimization of variational inequalities
Extreme point enumeration technique for assignment problem
Flow Polyhedra and Resource Constrained Project Scheduling Problems
This paper aims at describing the way Flow machinery may be used in order to deal with Resource Constrained Project Scheduling Problems (RCPSP). In order to do it, it first introduces the Timed Flow Polyhedron related to a RCPSP instance. Next it states several structural results related to connectivity and to cut management. It keeps on with a description of the way this framework gives rise to a generic Insertion operator, which enables programmers to design greedy and local search algorithms....
Funciones penalidad y lagrangianos aumentados.
Por medio de un conjunto de propiedades se caracteriza una amplia familia de funciones que pueden emplearse como penalidad para la resolución numérica de un problema de programación matemática. A partir de ellas se construye un algoritmo de penalizaciones demostrando su convergencia a un punto factible óptimo. Se estudia la situación de los mínimos sin restricciones respecto de la región factible, la monotonía de la sucesión de valores de la función auxiliar y se dan varias cotas de convergencia....
Genetic Algorithm Approach for Solving the Task Assignment Problem
This research was partially supported by the Serbian Ministry of Science and Ecology under project 144007. The authors are grateful to Ivana Ljubić for help in testing and to Vladimir Filipović for useful suggestions and comments.In this paper a genetic algorithm (GA) for the task assignment problem (TAP) is considered.An integer representation with standard genetic operators is used. Computational results are presented for instances from the literature, and compared to optimal solutions obtained...
Global convergence of a modified SQP method for mathematical programs with inequalities and equalities constraints.
Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations
In this paper, we discuss the globalization of some kind of modified Levenberg-Marquardt methods for nonsmooth equations and their applications to nonlinear complementarity problems. In these modified Levenberg-Marquardt methods, only an approximate solution of a linear system at each iteration is required. Under some mild assumptions, the global convergence is shown. Finally, numerical results show that the present methods are promising.