Abstract We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling framework for variety of applications. study stationarity regularity concepts, propose flexible augmented Lagrangian scheme. provide theoretical characte...

The paper aims at revealing the essence and connotation of Computational Thinking. It analyzed some of the international academia’s research results of Computational Thinking. The author thinks Computational Thinking is discipline thinking or computing philosophy, and it is very critical to understand Computational Thinking to grasp the thinking’ s computational features and the computing’s thi...

The manufacture of nitrocellulose, which is the basis of most artillery, tank, mortar and rocket propellant is intrinsically risky due to the energetic nature of the product and the sensitivity of the process. To optimise the performance of the nitrator, computational fluid dynamics (CFD) technology was employed to initially select a suitable impeller design and subsequently used to select an a...

in recent years, the trend in solving optimization problems has been directed toward using heuristic algorithms such as neural networks, genetic and ant colony algorithms. the main reason for this trend can be attributed to the fact that these algorithms can be efficiently adjusted to the specific search space to which they are applied and consequently they can be used for many optimization pro...

in this paper, we present a full newton step feasible interior-pointmethod for circular cone optimization by using euclidean jordanalgebra. the search direction is based on the nesterov-todd scalingscheme, and only full-newton step is used at each iteration.furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...