The bounds of feasible space on constrained nonconvex quadratic programming [PDF]
, 2008 This paper presents a method to estimate the bounds of the radius of the feasible space for a class of constrained nonconvex quadratic programmings. Results show that one may compute a bound of the radius of the feasible space by a linear programming ...
Zhu, Jinghao
core +1 more source
A note on set-semidefinite relaxations of nonconvex quadratic programs [PDF]
, 2013 We consider semidefinite, copositive, and more general, set-semidefinite programming relaxations of general nonconvex quadratic problems. For the semidefinite case a comparison between the feasible set of the original program and the feasible set of the ...
Ahmed, F., Still, Georg J.
core +1 more source
A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming [PDF]
, 2021 We present an approach to regularize and approximate solution mappings of parametric convex optimization problems that combines interior penalty (log-barrier) solutions with Tikhonov regularization.
Sagastizábal, Claudia +2 more
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
Performance Analysis of Optimization Methods in PSE Applications. Mathematical Programming Versus Grid-based Multi-parametric Genetic Algorithms [PDF]
, 2007 Due to their large variety of applications in the PSE area, complex optimisation problems are of high interest for the scientific community. As a consequence, a great effort is made for developing efficient solution techniques. The choice of the relevant
Ponsich, Antonin Sebastien +8 more
core +1 more source
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming [PDF]
, 2023 Solution methods for generalized Nash equilibrium have been dominated by variational inequalities and complementarity problems. Since these approaches fundamentally rely on the sufficiency of first-order optimality conditions for the players' decision ...
Papageorgiou, Dimitri +3 more
core +2 more sources
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
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