The exactness of the ℓ1 penalty function for a class of mathematical programs with generalized complementarity constraints [PDF]
Fundamental ResearchIn a mathematical program with generalized complementarity constraints (MPGCC), complementarity relation is imposed between each pair of variable blocks.
Yukuan Hu, Xin Liu
doaj +2 more sources
An improved Jaya optimization algorithm with ring topology and population size reduction
Journal of Intelligent Systems, 2022 An improved variant of the Jaya optimization algorithm, called Jaya2, is proposed to enhance the performance of the original Jaya sacrificing its algorithmic design. The proposed approach arranges the solutions in a ring topology to reduce the likelihood
Omran Mahamed G. H., Iacca Giovanni
doaj +1 more source
A new conjugate gradient method for acceleration of gradient descent algorithms
Moroccan Journal of Pure and Applied Analysis, 2021 An accelerated of the steepest descent method for solving unconstrained optimization problems is presented. which propose a fundamentally different conjugate gradient method, in which the well-known parameter βk is computed by an new formula.
Rahali Noureddine +2 more
doaj +1 more source
Frontiers in Applied Mathematics and Statistics, 2022 In this work, a new class of spectral conjugate gradient (CG) method is proposed for solving unconstrained optimization models. The search direction of the new method uses the ZPRP and JYJLL CG coefficients.
Fevi Novkaniza +3 more
doaj +1 more source
Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
Open Mathematics, 2019 This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj +1 more source
Outcome space range reduction method for global optimization of sum of affine ratios problem
Open Mathematics, 2016 Many algorithms for globally solving sum of affine ratios problem (SAR) are based on equivalent problem and branch-and-bound framework. Since the exhaustiveness of branching rule leads to a significant increase in the computational burden for solving the
Jiao Hongwei +3 more
doaj +1 more source
A reduced space branch and bound algorithm for a class of sum of ratios problems
Open Mathematics, 2018 Sum of ratios problem occurs frequently in various areas of engineering practice and management science, but most solution methods for this kind of problem are often designed for determining local solutions .
Zhao Yingfeng, Zhao Ting
doaj +1 more source
Global resolution of the support vector machine regression parameters selection problem with LPCC
EURO Journal on Computational Optimization, 2015 Support vector machine regression is a robust data fitting method to minimize the sum of deducted residuals of regression, and thus is less sensitive to changes of data near the regression hyperplane. Two design parameters, the insensitive tube size (εe)
Yu-Ching Lee +2 more
doaj +1 more source
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Open Mathematics, 2017 This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong +3 more
doaj +1 more source
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +1 more source