Results 21 to 30 of about 24,807 (199)

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, Pengcheng Wang, Zifan Xu, Zhipeng Feng, Congtong Zhang, Jinwen Wang, Cheng Chen   +6 more
doaj   +1 more source

Global Solutions to Nonconvex Optimization of 4th-Order Polynomial and Log-Sum-Exp Functions [PDF]

, 2014
This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences.
Chen, Yi, Gao, David Y
core   +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

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, Pei-Ping Shen, Yong-Gang Pei   +2 more
doaj   +1 more source

A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure

, 2014
Yuan's theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions.
Hu, Shenglong, Li, Guoyin, Qi, Liqun
core   +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

Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming

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