Dingguo Pu

According to our database1, Dingguo Pu authored at least 17 papers between 2009 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
An infeasible active-set QP-free algorithm for general nonlinear programming.
Int. J. Comput. Math., 2017

2015
A trust-region SQP method without a penalty or a filter for nonlinear programming.
J. Comput. Appl. Math., 2015

2014
An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization.
Optim. Methods Softw., 2014

3-1 Piecewise NCP Function for New Nonmonotone QP-Free Infeasible Method.
J. Robotics Mechatronics, 2014

2013
A restoration-free filter SQP algorithm for equality constrained optimization.
Appl. Math. Comput., 2013

An SQP Algorithm with Flexible Penalty Functions.
Proceedings of the Sixth International Conference on Business Intelligence and Financial Engineering, 2013

A Class of New Lagrangian Multiplier Methods.
Proceedings of the Sixth International Conference on Business Intelligence and Financial Engineering, 2013

The Convergence of Broyden Algorithms without Convexity.
Proceedings of the Sixth International Conference on Business Intelligence and Financial Engineering, 2013

A Smoothing QP-free Infeasible Method without a Penalty Function and a Filter.
Proceedings of the Sixth International Conference on Business Intelligence and Financial Engineering, 2013

A Sequential Quadratic Programming Method for Nonlinear Programming without a Penalty or a Filter.
Proceedings of the Sixth International Conference on Business Intelligence and Financial Engineering, 2013

2012
Primal and Dual Variables for New QP-free Method without a Penalty Function and a Filter.
Proceedings of the Fifth International Joint Conference on Computational Sciences and Optimization, 2012

New Form of Lagrangian Multiplier Methods.
Proceedings of the Fifth International Joint Conference on Computational Sciences and Optimization, 2012

2011
An infeasible Ssle Filter Algorithm for General Constrained Optimization without Strict complementarity.
Asia Pac. J. Oper. Res., 2011

2010
An infeasible nonmonotone SSLE algorithm for nonlinear programming.
Math. Methods Oper. Res., 2010

Smoothing Newton method for NCP with the identification of degenerate indices.
J. Comput. Appl. Math., 2010

2009
A new non-monotone SQP algorithm for the minimax problem.
Int. J. Comput. Math., 2009

A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming.
Int. J. Comput. Math., 2009


  Loading...