The exactness of the ℓ1 penalty function for a class of mathematical programs with generalized complementarity constraints [PDF]
In 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
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
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
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
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
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
On the convergence of min/sup points in optimal control problems
We modify the definition of lopsided convergence of bivariate functionals to obtain stability results for the min/sup points of some control problems. In particular, we develop a scheme of finite dimensional approximations to a large class of non‐convex control problems.
Adib Bagh
wiley +1 more source
A reduced space branch and bound algorithm for a class of sum of ratios problems
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
A global method for some class of optimization and control problems
The problem of maximizing a nonsmooth convex function over an arbitrary set is considered. Based on the optimality condition obtained by Strekalovsky in 1987 an algorithm for solving the problem is proposed. We show that the algorithm can be applied to the nonconvex optimal control problem as well.
R. Enkhbat
wiley +1 more source
Global resolution of the support vector machine regression parameters selection problem with LPCC
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

