Results 91 to 100 of about 838,365 (209)

Outer Approximation Algorithms for DC Programs and Beyond [PDF]

, 2008
We consider the well-known Canonical DC (CDC) optimization problem, relying on an alternative equivalent formulation based on a polar characterization of the constraint, and a novel generalization of this problem, which we name Single Reverse Polar ...
ZHANG, QINGHUA
core   +1 more source

Análise e testes numéricos de um algoritmo de pontos interiores para programação não linear [PDF]

, 2002
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro de Ciências Físicas e Matemáticas. Programa de Pós-Graduação em Matemática e Computação Científica.Neste trabalho apresentamos alguns aspectos computacionais e ...
Casali, Rafael Machado
core  

An Efficient Branch-and-Bound Algorithm for Globally Minimizing a Class of Generalized Linear Multiplicative Programs

Journal of Mathematics
This study presents a novel algorithm for globally solving generalized linear multiplicative programming (GLMP) problems. We first introduce a convex-separation technique to craft a tight yet computationally tractable linear relaxation that supplies ...
Peng Hu, Zhiyou Wu, Tao Yang, Jia Liu, Bangying Xin   +4 more
doaj   +1 more source

Interior Point Methods for Nonconvex Nonlinear Programming

, 2008
The contribution contains a short description of interior point s methods for nonconvex nonlinear programming problems together with results proposed by authors in special ...
Lukšan, Ladislav
core  

An obstacle-avoidance inverse kinematics method for robotic manipulator in overhead multi-line environment

Engineering Science and Technology, an International Journal
The inverse kinematics problem plays a crucial role in robotic manipulator planning, autonomous control, and object grasping. This problem can be solved in simple environments based on existing studies.
Pengju Yang, Feng Shen, Dingjie Xu, Bingxing Chen, Ronghai Liu, Hongwu Wang   +5 more
doaj   +1 more source

Joint beamforming for multiuser SCFDE block transmission system in frequency selective MIMO channels

Tongxin xuebao, 2013
Single carrier frequency domain equalization (SCFDE) joint beamforming in frequency selective multiple input multiple output (MIMO) channels under the multi-user scenario was analyzed.Firstly,the frequency domain beamforming was transformed to a time ...
Li-zhou Xu, Jian JIANG, Sheng DING, Ying-guan WANG   +3 more
doaj   +2 more sources

Gap inequalities for non-convex mixed-integer quadratic programs [PDF]

, 2011
Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs ...
Galli, Laura, Kaparis, Konstantinos, Letchford, A N   +2 more
core  

Locally Ideal Formulations for Piecewise Linear Functions with Indicator Variables [PDF]

, 2013
In this paper, we consider mixed integer linear programming (MIP) formulations for piecewise linear functions (PLFs) that are evaluated when an indicator variable is turned on.
Linderoth, Jeff, James Luedtke, Luedtke, Jim, Luedtke, James, Sridhar, Srikrishna, Srikrishna Sridhar, Jeff Linderoth   +6 more
core  

n-Person Nonconvex Bargaining: Efficient Proportional Solution [PDF]

For n-person bargaining problems the family of proportional solutions (introduced and characterized by Kalai) is generalized to bargaining problems with non-convex payoff sets.
Mich Tvede, Jens Leth Hougaard
core  

Canonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming

, 2004
This paper presents a perfect duality theory and a complete set of solutions to nonconvex quadratic programming problems subjected to inequality constraints.
David Yang Gao
core