Convex Optimization
Mostrando 1-12 de 54 artigos, teses e dissertações.
-
1. Synthesis of Sparse Arrays Based On CIGA (Convex Improved Genetic Algorithm)
Abstract In this paper, a novel hybrid algorithm on beam pattern synthesis of sparse arrays is proposed, which aims at minimizing the peak sidelobe level (PSLL). Sparse arrays can provide higher spatial resolution and relatively lower sidelobe than general arrays, but it is necessary to solve the multi-constraint problem of nonconvex nonlinear. Thus, we prop
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2020-12
-
2. A Model Predictive Guidance Strategy for a Multirotor Aerial Vehicle
ABSTRACT: The present study faces the problem of safely controlling the position trajectory of a multirotor aerial vehicle subjected to a conic constraint on the total thrust vector and a linear convex constraint on the position vector. The problem is solved using a linear state-space model predictive control strategy, whose optimization is made handy by rep
J. Aerosp. Technol. Manag.. Publicado em: 2017-03
-
3. Static Limit Analysis of Reinforced Soil Structures by a Simple Finite Element and Second-Order Cone Programming
Abstract To discretize reinforced soil structures in plane strain and predict their collapse load, a simple three-node triangular finite element is formulated based on the static theorem of the limit analysis. The element satisfies the equilibrium equations and the mechanical boundary conditions in a weak sense. A modified Mohr-Coulomb yield surface is adopt
Lat. Am. j. solids struct.. Publicado em: 2017
-
4. A Heuristic Algorithm Based on Line-up Competition and Generalized Pattern Search for Solving Integer and Mixed Integer Non-linear Optimization Problems
Abstract The global optimization of integer and mixed integer non-linear problems has a lot of applications in engineering. In this paper a heuristic algorithm is developed using line-up competition and generalized pattern search to solve integer and mixed integer non-linear optimization problems subjected to various linear or nonlinear constraints. Due to i
Lat. Am. j. solids struct.. Publicado em: 2016-02
-
5. COMPLEXITY OF FIRST-ORDER METHODS FOR DIFFERENTIABLE CONVEX OPTIMIZATION
This is a short tutorial on complexity studies for differentiable convex optimization. A complexity study is made for a class of problems, an "oracle" that obtains information about the problem at a given point, and a stopping rule for algorithms. These three items compose a scheme, for which we study the performance of algorithms and problem complexity. Our
Pesqui. Oper.. Publicado em: 2014-12
-
6. BUNDLE METHODS IN THE XXIst CENTURY: A BIRD'S-EYE VIEW
Bundle methods are often the algorithms of choice for nonsmooth convex optimization, especially if accuracy in the solution and reliability are a concern. We review several algorithms based on the bundle methodology that have been developed recently and that, unlike their forerunner variants, have the ability to provide exact solutions even if most of the ti
Pesqui. Oper.. Publicado em: 2014-12
-
7. A Mixed-Integer convex formulation for production optimization of gas-lifted oil fields with routing and pressure constraints
Production optimization of gas-lifted oil fields under facility, routing, and pressure constraints has attracted the attention of researchers and practitioners for its scientific challenges and economic impact. The available methods fall into one of two categories: nonlinear or piecewise-linear approaches. The nonlinear methods optimize simulation models dir
Braz. J. Chem. Eng.. Publicado em: 2014-06
-
8. A method for solving linear programming models with Interval Type-2 fuzzy constraints
This paper shows a method for solving linear programming problems that includes Interval Type-2 fuzzy constraints. The proposed method finds an optimal solution in these conditions using convex optimization techniques. Some feasibility conditions are presented, and some interpretation issues are discussed. An introductory example is solved using the proposed
Pesqui. Oper.. Publicado em: 08/04/2014
-
9. Convergência do Método do Ponto Proximal para Funções que Satisfazem a Desigualdade de Łojasiewicz / Convergence of the Proximal Point Method for functions that satisfy the inequality of Lojasiewicz
Neste trabalho é feita uma análise de convergência do Método do Ponto Proximal para funções não necessariamente convexas que satisfazem a desigualdade de Łojasiewicz.
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 27/06/2012
-
10. Tópicos em métodos ótimos para otimização convexa / Topics in optimal methods for convex optimization
Neste trabalho apresentamos um novo método ótimo para otimização de uma função convexa diferenciável sujeita a restrições convexas. Nosso método é baseado em ideias de Nesterov e Auslender e Teboulle. A proposta dos últimos autores usa uma distância de Bregman coerciva para garantir que os iterados permaneçam no interior do conjunto viável. No
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 29/03/2012
-
11. Estratégias com garantia de estabilidade para a integração de controle preditivo e otimização em tempo real. / Strategies with guarantee of stability for the integration of model predictive control and real time optimization
The aim of this Thesis is the development of predictive controllers (MPC) with guarantee of stability and that are part of a control structure where Real Time Optimization (RTO) is present and produces optimizing targets for the predictive controller. The approaches of two and three-layer are considered. Three different strategies are presented: the first st
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/03/2012
-
12. Estudo de um Sistema de NÃvel com Dois Tanques Interligados Sujeito a PerturbaÃÃes Utilizando Desigualdades Matriciais Lineares / Study of a system level with two tanks interconnected subject to disturbances using linear matrix inequalities
A teoria de controle robusto evoluiu consideravelmente ao longo das Ãltimas dÃcadas, apresentando soluÃÃes para vÃrios tipos de problemas de anÃlise, desempenho e sÃntese de sistemas lineares incertos. As desigualdades matriciais lineares (LMIs) e suas tÃcnicas surgiram como poderosas ferramentas em diversas Ãreas de engenharia de controle para proj
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 24/01/2012