In order to decrease the complexity of the topological sort algorithms which are based on adjacency matrix, the single-vertex algorithm framework was expanded to the set algorithm framework, and some properties of Directed Acyclic Graph (DAG) propitious for topological sort were given.

Based on the strict description of the structure and instances about the optimization problems,this paper proposes an approach to slove the design problem of optimization algorithm,which follows a path from algorithm framework to algorithm mode,and up to concrete algorithm.

BThis paper presents a quadratically approximate algorithm framework(QAAF) for solving general constrained optimization problems, the framework solvesat each iteration a subproblem with quadratic objective function and quadraticequality together with inequality constraints.

Home Banking Service System Using HMM Framework;