A new method for the solution of nonlinear programming problem;

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

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.

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

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

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

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

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.