Results 21 to 30 of about 24,658 (179)
A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization
Abstract and Applied Analysis, 2013 A class of constrained nonsmooth nonconvex optimization problems, that is, piecewise C2 objectives with smooth inequality constraints are discussed in this paper.
Yuan Lu, Wei Wang, Li-Ping Pang, Dan Li
doaj +1 more source
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
Finding largest small polygons with GloptiPoly [PDF]
, 2010 A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices $n$. Many instances are already solved in the literature, namely for all odd $n$, and for $n=4, 6$ and 8.
C. Audet +17 more
core +6 more sources
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
A Framework for Globally Optimizing Mixed-Integer Signomial Programs [PDF]
, 2013 Mixed-integer signomial optimization problems have broad applicability in engineering. Extending the Global Mixed-Integer Quadratic Optimizer, GloMIQO (Misener, Floudas in J. Glob. Optim., 2012. doi:10.1007/s10898-012-9874-7), this manuscript documents a
Floudas, CA, Misener, R
core +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
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
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
Nonconvex composite multiobjective nonsmooth fractional programming [PDF]
Journal of Inequalities and Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, Ho, Kim, Do
openaire +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