Interior Points Algorithm
Mostrando 1-8 de 8 artigos, teses e dissertações.
-
1. Determination of the reinforced concrete slabs ultimate load using finite element method and mathematical programming
In the present paper, the ultimate load of the reinforced concrete slabs [16] is determined using the finite element method and mathematical programming. The acting efforts and displacements in the slab are obtained by a perfect elasto-plastic analysis developed by finite element method. In the perfect elasto-plastic analysis the Newton-Raphson method [20] i
Latin American Journal of Solids and Structures. Publicado em: 2012
-
2. Estudo teórico experimental da dinâmica de temperatura no interior de uma cavidade cilíndrica. / EXPERIMENTAL THEORETICAL STUDY OF DYNAMIC TEMPERATURE AT A CYLINDRICAL
Two methods for solving a direct heat diffusion problem inside a cylindrical enclosure are proposed, each one is applied with a linear and plus a non-linear solution. Besides, a experimental apparatus was developed for theoretical models validation purpose. Furthermore, as an application of the proposed system the inverse analysis (inverse problem) is used t
Publicado em: 2010
-
3. Estrategias de segunda ordem para problemas de complementaridade / Second order strategies for complementarity problems
In this work we reformulate the generalized nonlinear complementarity problem (GNCP) in polyhedral cones as a nonlinear system with nonnegativity in some variables and propose the resolution of such reformulation through interior-point methods. In particular we define two algorithms and prove the local convergence of these algorithms under standard assumptio
Publicado em: 2009
-
4. Otimização de estruturas reticuladas planas com comportamento geometricamente não linear / Optimization of plane frame structures with behavior geometrically nonlinear
The aim of this work is to present a formulation and corresponding computational implementation for sizing optimization of plane frames and cable-stayed columns considering geometric non liner behavior. The structural analysis is based on the finite element method using the updated lagrangian approach for plane frame and cable elements, which are represented
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 20/10/2006
-
5. Aplicação de técnicas de programação linear e extensões para otimização da alocação de água em sistemas de recursos hídricos, utilizando métodos de pontos interiores. / Application of linear programming techniques and extensions for optimization of water allocation in water resource systems, using interior points methods.
This work presents an optimization tool for analyzing the problems of water allocation in watersheds by utilizing techniques of linear and piecewise linear programming integrated to a pattern of stream flow routing. The optimization is done in a global way with the usage of linear programming packages based upon the Internal Point Methods. The methodology of
Publicado em: 2006
-
6. AN ALGORITHM FOR CURVE RECONSTRUCTION FROM SPARSE POINTS / UM ALGORITMO PARA RECONSTRUÇÃO DE CURVAS A PARTIR DE PONTOS ESPARSOS
Curve and surface reconstruction from sparse data has been recognized as an important problem in computer graphics. Non structured data points (i.e., a set of points with no knowledge of connectivity and proximity) together with the existence of noise make this problem quite difficult. In order to solve it, several techniques have been proposed, such as, som
Publicado em: 2003
-
7. DESIGN OF CONCRETE SLAB PANELS USING THE FINITE ELEMENT METHOD AND MATHEMATICAL PROGRAMMING / FERRAMENTAS COMPUTACIONAIS PARA O PROJETO DE LAJES DE CONCRETO ARMADO
In this work it is presented computational methodologies for the design of reinforced concrete massive slabs. The design of the slabs is made using an elastic and perfect elastoplastic analysis, an optimum design using mathematical programming and a plastic analysis project. The conventional project of reinforced concrete slabs has been made starting from ef
Publicado em: 1998
-
8. Partição retangular minima de um retangulo em programação linear inteira
Given a rectangle R in the plane and a non empty finite set P of points in the interior of R, we study the problem of partitioning R into smaller rectangles such that no point in P is interior to any rectangle of the partition. The goal is to minimize the sum of the lengths of the straight line segments defining the partition. This problem is NP-hard and a g
Publicado em: 1997