An SQP Algorithm for Recourse-based Stochastic Nonlinear Programming
Journal: Advances in Computer Science : an International Journal(ACSIJ) (Vol.5, No. 3)Publication Date: 2016-05-31
Authors : Xinshun Ma; Cunzhe Liu;
Page : 28-32
Keywords : stochastic programming; nonlinear constraints; SQP;
Abstract
The stochastic nonlinear programming problem with completed recourse and nonlinear constraints is studied in this paper. We present a sequential quadratic programming method for solving the problem based on the certainty extended nonlinear model. This algorithm is obtained by combing the active set method and filter method. The convergence of the method is established under some standard assumptions. Moreover, a practical design is presented and numerical results are provided.
Other Latest Articles
- Improving OPTICS Algorithm with Imperialist Competitive Algorithm: Choosing Automatically Best Parameters
- Developing a Hybrid GPS/Wi-Fi Navigation System for User Guidance
- COPADS IV: Fixed Time-Step ODE Solvers for a System of Equations Implemented as a Set of Python Functions
- Heuristic Algorithm for Identifying Critical Nodes in Graphs
- CONSULTATION-LIASON PSYCHIATRY PRACTICE IN A NIGERIAN TEACHING HOSPITAL
Last modified: 2016-06-05 01:24:25