نتایج جستجو برای: nonconvex problem
تعداد نتایج: 882470 فیلتر نتایج به سال:
In this paper a global optimization algorithm for solving sum of quadratic ratios problem with coefficients and nonconvex quadratic function constraints (NSP ) is proposed. First, the problem NSP is converted into an equivalent sum of linear ratios problem with nonconvex quadratic constraints ( LSP ). Using linearization technique, the linearization relaxation of LSP is obtained. The whole prob...
In this paper, we suggest and analyze a new system of extended regularized nonconvex variational inequalities and prove the equivalence between the aforesaid system and a fixed point problem. We introduce a new perturbed projection iterative algorithm with mixed errors to find the solution of the system of extended regularized nonconvex variational inequalities. Furthermore, under moderate assu...
A class of non-smooth and non-convex optimization problems with penalty constraints linked to variational inequalities (VI) is studied respect its shape differentiability. The specific problem stemming from quasi-brittle fracture describes an elastic body a Barenblatt cohesive crack under the inequality condition non-penetration at faces. Based on Lagrange approach using smooth penalization Lav...
We consider nonconvex quadratic optimization problems with binary constraints. Our main result identifies a class of quadratic problems for which a given feasible point is global optimal. We also establish a necessary global optimality condition. These conditions are expressed in a simple way in terms of the problem’s data. We also study the relations between optimal solutions of the nonconvex ...
We present a Branch and Cut algorithm of the software package LaGO to solve nonconvex mixed-integer nonlinear programs (MINLPs). A linear outer approximation is constructed from a convex relaxation of the problem. Since we do not require an algebraic representation of the problem, reformulation techniques for the construction of the convex relaxation cannot be applied, and we are restricted to ...
This paper addresses the problem of integrating in a single model operational optimization and cyclic scheduling of continuous plants. Considered are multiproduct, multistage plants with finite intermediate storage capacity (FIS). A combined optimization approach introduces synergic effects for more effective scheduling and plant operation (Alle and Pinto, 2001a,b). The representation proposed ...
This paper illustrates the fundamental connection between nonconvex quadratic optimization and copositive optimization—a connection that allows the reformulation of nonconvex quadratic problems as convex ones in a unified way. We focus on examples having just a few variables or a few constraints for which the quadratic problem can be formulated as a copositive-style problem, which itself can be...
In this paper, we are analyzing the performance of energy efficient power allocation for secure orthogonal frequency division multiple access (OFDMA) based cognitive radio networks (CRN‟s). The power allocation schemes are optimized for maximization of the energy efficiency [4] in secure data transmission. The nonconvex optimization problem takes into account to maximize the energy efficiency m...
This paper studies a fundamental bicriteria optimization problem for variable selection in statistical learning; the two criteria are a loss/residual function and a model control (also called regularization, penalty). The former function measures the fitness of the learning model to data and the latter function is employed as a control of the complexity of the model. We focus on the case where ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید