位置：成果数据库 > 期刊 > 期刊详情页
A filled function method for finding a global minimizer on global integer optimization
  • ISSN号：0377-0427
  • 期刊名称：Journal of Computational and Applied Mathematics
  • 时间：0
  • 页码：200-210
  • 语言：英文
  • 相关项目：求全局最优解的函数变换方法
作者： Shang, YL|Zhang, LS|
同期刊论文项目
求全局最优解的函数变换方法
期刊论文 34
同项目期刊论文
A revised conjugate gradient projection algorithm for inequality constrained optimizations
Quadratic smoothing approximation to l(1) exact penalty function in global optimization
A level-value estimation method for solving global optimization
A novel filled function method and quasi-filled function method for global optimization
A new filled function method for integer programming
A class of augmented Lagrangians for equality constraints in nonlinear programming problems
Discrete filled function method for discrete global optimization
New modified function method for global optimization
A new two-level linear relaxed bound method for geometric programming problems
Semi-definite relaxation algorithm for single machine scheduling with controllable processing times
Exact augmented Lagrangian function for nonlinear programming problems with inequality constraints
Monotonization in global optimization
Convexification and concavification for a general class of global optimization problems
Newton method for solving a class of smooth convex programming
Unification of filled function and tunnelling function in global optimization
A filled function method with one parameter for box constrained global optimization
A filled function method for global optimization
Discrete global descent method for discrete global optimization and nonlinear integer programming
A new tunnel function method for global optimization
Finding discrete global minima with a filled function for integer programming
Peeling off a nonconvex cover of an actual convex problem: Hidden convexity
一个新的简单精确光滑罚函数
0-1多项式背包问题的一种精确算法
一类关于非光滑全局优化的双参数填充函数
在Armijo型线搜索下共轭梯度法簇的全局收敛性
关于约束极小化问题的一个新的简单精确罚函数
约束全局优化问题的一个单参数填充函数方法
带组约束可靠性网络最优化问题的精确算法
全局优化问题的一个单参数填充函数方法
一些约束规划问题的近似全局最优解
关于一类等式约束优化的简单光滑精确罚函数
关于求解全局优化的途径：从局部到全局
Surrogate dual method for multi-dimensional nonlinear knapsack problems