Results 1 to 10 of about 3,006 (163)
Quadratic Convex Reformulations for Semicontinuous Quadratic Programming [PDF]
SIAM Journal on Optimization, 2017 Summary: We consider in this paper a class of semicontinuous quadratic programming problems, which arises in many real-world applications such as production planning, portfolio selection, and subset selection in regression. We build upon the idea of the quadratic convex reformulation approach, i.e., adding to the original objective function an ...
Duan Li, Xiaojin Zheng, Baiyi Wu
exaly +2 more sources
On convex relaxations for quadratically constrained quadratic programming [PDF]
Mathematical Programming, 2012 A quadratically constrained (possibly non-convex) quadratic programming problem is considered. The efficiency, for this problem, of several known convex underestimating methods is analyzed. The underestimates, obtained by means of the considered methods, are ranked according to their tightness.
Kurt Anstreicher, Anstreicher Kurt M
exaly +2 more sources
An algorithm for indefinite quadratic programming with convex constraints [PDF]
Operations Research Letters, 1991 The authors present a new branch-and-bound method for solving the following problem: \[ \min(f(x,y)=p^ T x+x^ T My+q^ T y: (x,y)\in S), \] where \(S\subset R^ n\times R^ m\) is a closed convex non-empty set, \(p\in R^ n\) and \(q\in R^ m\) are given vectors and \(M\) is a given \(n\times m\) matrix.
W Oettli
exaly +4 more sources
Convex Quadratic Sets and the Complexity of Mixed Integer Convex Quadratic Programming
SIAM Journal on OptimizationIn pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using the Hermite normal form, it is possible to map a non full-dimensional polyhedron to a full-dimensional isomorphic
Alberto Del Pia
exaly +4 more sources
Survey of sequential convex programming and generalized Gauss-Newton methods* [PDF]
ESAIM: Proceedings and Surveys, 2021 We provide an overview of a class of iterative convex approximation methods for nonlinear optimization problems with convex-over-nonlinear substructure.
Messerer Florian +2 more
doaj +1 more source
Least Squares Method for Solving Fuzzy LR Interval Algebraic Linear Systems
Fuzzy Information and Engineering, 2022 We first investigate the solvability conditions of fuzzy LR interval algebraic linear systems with fuzzy LR interval coefficient matrix and fuzzy LR interval hand-right vector.
Mehrnoosh Salari +2 more
doaj +1 more source
Optimal Power Flow Solution for Bipolar DC Networks Using a Recursive Quadratic Approximation
Energies, 2023 The problem regarding of optimal power flow in bipolar DC networks is addressed in this paper from the recursive programming stand of view. A hyperbolic relationship between constant power terminals and voltage profiles is used to resolve the optimal ...
Oscar Danilo Montoya +2 more
doaj +1 more source
Reactive Power Scheduling Using Quadratic Convex Relaxation [PDF]
Journal of Operation and Automation in Power Engineering, 2022 In this paper, quadratic convex relaxation (QCR) is used to relax AC optimal power flow (AC-OPF) used for reactive power scheduling (RPS) of the power system.
E. Limouzadeh, A. Rabiee
doaj +1 more source
Degree reduction of Rational Bézier curves by hybrid optimization method
Results in Applied Mathematics, 2022 The paper addresses the problem of degree reduction of rational Bézier curves. A new optimization problem is formulated based on the weighted sum method, weighted least squares and quadratic programming.
Mao Shi
doaj +1 more source
Journal of Inequalities and Applications, 2023 In this paper, we present an inexact multiblock alternating direction method for the point-contact friction model of the force-optimization problem (FOP).
Yaling Zhang, Xuewen Mu
doaj +1 more source