Results 31 to 40 of about 838,365 (209)
Reformulating mixed-integer quadratically constrained quadratic programs [PDF]
, 2011 It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather ...
Galli, L, Letchford, A. N.
core +4 more sources
Hydropower Unit Commitment Using a Genetic Algorithm with Dynamic Programming
Energies, 2023 This study presents a genetic algorithm integrated with dynamic programming to address the challenges of the hydropower unit commitment problem, which is a nonlinear, nonconvex, and discrete optimization, involving the hourly scheduling of generators in ...
Shuangquan Liu +6 more
doaj +1 more source
An accelerating algorithm for globally solving nonconvex quadratic programming
Journal of Inequalities and Applications, 2018 To globally solve a nonconvex quadratic programming problem, this paper presents an accelerating linearizing algorithm based on the framework of the branch-and-bound method. By utilizing a new linear relaxation approach, the initial quadratic programming
Li Ge, Sanyang Liu
doaj +1 more source
Global Optimization for the Sum of Concave-Convex Ratios Problem
Journal of Applied Mathematics, 2014 This paper presents a branch and bound algorithm for globally solving the sum of concave-convex ratios problem (P) over a compact convex set. Firstly, the problem (P) is converted to an equivalent problem (P1).
XueGang Zhou, JiHui Yang
doaj +1 more source
A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
Abstract and Applied Analysis, 2014 This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set.
Lin-Peng Yang +2 more
doaj +1 more source
Neutrosophic Geometric Programming (NGP) Problems Subject to (⋁, . ) Operator; the Minimum Solution [PDF]
Neutrosophic Sets and Systems, 2020 This paper comes as a second step serves the purpose of constructing a neutrosophic optimization model for the relation geometric programming problems subject to (max, product) operator in its constraints.
Huda E. Khalid
doaj +1 more source
Journal of Mathematics, 2020 In the paper, the aggregate constraint-shifting homotopy method for solving general nonconvex nonlinear programming is considered. The aggregation is only about inequality constraint functions. Without any cone condition for the constraint functions, the
Zhichuan Zhu, Yeong-Cheng Liou
doaj +1 more source
Sufficient optimality criteria and duality for multiobjective variational control problems with B-(p,r)-invex functions [PDF]
Opuscula Mathematica, 2014 In this paper, we generalize the notion of \(B\)-\((p,r)\)-invexity introduced by Antczak in [A class of \(B\)-\((p; r)\)-invex functions and mathematical programming, J. Math. Anal. Appl. 286 (2003), 187-206] for scalar optimization problems to the case
Tadeusz Antczak, Manuel Arana Jiménez
doaj +1 more source
Sparse Signal Recovery via Exponential Metric Approximation
Tsinghua Science and Technology, 2017 Sparse signal recovery problems are common in parameter estimation, image processing, pattern recognition, and so on. The problem of recovering a sparse signal representation from a signal dictionary might be classified as a linear constraint ℓ0 ...
Jian Pan, Jun Tang, Wei Zhu
doaj +1 more source
An Accelerating Algorithm for Linear Multiplicative Programming Problem
IEEE Access, 2020 By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP).
Shuai Tang, Zhisong Hou, Longquan Yong
doaj +1 more source