1)  nonlinear programming problem

1.
A new method for the solution of nonlinear programming problem;

2.
Global convergence of an interior-point potential reduction algorithm for nonlinear programming problems.;

3.
Presents a special nonlinear programming problems,its objective function contains absolute value symbol,this kind of problem can be transformed to the solution of a linear programming problems.

2)  nonlinear programming problems

1.
A new algorithm for solving nonlinear programming problems(NLP) is advanced based on Guo s algorithm.

2.
It is capable of solving nonlinear programming problems with the constraints of equality and inequality.

3.
Recently, a combined homotopy interior point method (denoted as CHIP method for convenience) was presented to solve a class of nonlinear programming problems.

3)  Maximal clique problem

4)  nonconvex nonlinear programming problems

1.
We utilized the combined maximum entropy homotopy method to solve the general nonconvex nonlinear programming problems.

5)  constrained nonlinear programming problem

1.
This dissertation studies mainly theories and according numerical implementation of a class of dual algorithms for nonlinear optimization problems, including unconstrained minimax problems and constrained nonlinear programming problems.

6)  non-linear programing/paperboy problem

 非线性规划nonlinear programming    目标函数是非线性函数或约束条件不全是线性等式（不等式）的一类数学规划。在科学管理和其他领域中，很多实际问题可以归结为线性规划，但还有另一些问题属于非线性规划。由于非线性规划含有深刻的背景和丰富的内容，已发展为运筹学的重要分支，并且在最优设计、管理科学、系统控制等领域得到越来越广泛的应用。   非线性规划的研究始于1939年，是由W.卡鲁什首次进行的，40年代后期进入系统研究，1951年H.W.库恩和A.W.塔克尔提出最优化的判别条件，从而奠定了非线性规划的理论基础，后来在理论研究和实用算法方面都有很大的发展。   非线性规划求解方法可分为无约束问题和约束问题来讨论，前者实际上就是多元函数的极值问题，是后一问题的基础。无约束问题的求解方法有最速下降法、共轭梯度法、变尺度法和鲍威尔直接法等。关于约束问题情况比较复杂，因为在迭代过程中除了要使目标函数下降外，还要考虑近似解的可行性。总的原则是设法将约束问题化为无约束问题；把非线性问题化为线性问题从而使复杂问题简单化。求解方法有可行方向法、制约函数法、简约梯度法、约束变尺度法、二次规划法和约束集法等。虽然这些方法都有较好的效果，但是尚未找到可以用于解决所有非线性规划的统一算法。