Chengxian Xu

According to our database1, Chengxian Xu authored at least 32 papers between 1999 and 2015.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Cultivation of Service Outsourcing Talents Based on Innovative Cooperation Mode Between Institute and Enterprises.
Trans. Edutainment, 2015

2014
A globally and locally superlinearly convergent inexact Newton-GMRES method for large-scale variational inequality problem.
Int. J. Comput. Math., 2014

An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function.
Appl. Math. Comput., 2014

2013
Erratum to: A trust region method for solving semidefinite programs.
Comput. Optim. Appl., 2013

A trust region method for solving semidefinite programs.
Comput. Optim. Appl., 2013

2012
Inexact non-interior continuation method for monotone semidefinite complementarity problems.
Optim. Lett., 2012

A mixed 0-1 LP for index tracking problem with CVaR risk constraints.
Ann. Oper. Res., 2012

2011
A modified SLP algorithm and its global convergence.
J. Comput. Appl. Math., 2011

2010
Inverse optimization for linearly constrained convex separable programming problems.
Eur. J. Oper. Res., 2010

2009
Nonlinear Least Squares Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Nonlinear Least Squares: Trust Region Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Nonlinear Least Squares: Newton-type Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Generalized Total Least Squares.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A Continuation Approach Using NCP Function for Solving Max-Cut Problem.
Asia Pac. J. Oper. Res., 2009

2007
A compact limited memory method for large scale unconstrained optimization.
Eur. J. Oper. Res., 2007

2006
Mean-variance portfolio optimal problem under concave transaction cost.
Appl. Math. Comput., 2006

A multiple penalty function method for solving Max-Bisection problems.
Appl. Math. Comput., 2006

An outcome-space finite algorithm for solving linear multiplicative programming.
Appl. Math. Comput., 2006

Linear Programming Relax-PSO Hybrid Bound Algorithm for a Class of Nonlinear Integer Programming Problems.
Proceedings of the Computational Intelligence and Security, International Conference, 2006

2005
A branch and bound algorithm for solving a class of D-C programming.
Appl. Math. Comput., 2005

A new two-level linear relaxed bound method for geometric programming problems.
Appl. Math. Comput., 2005

A Method to Locate the Position of Mobile Robot Using Extended Kalman Filter.
Proceedings of the Computational Intelligence and Security, International Conference, 2005

A New Class of Filled Functions for Global Minimization.
Proceedings of the Computational Intelligence and Security, International Conference, 2005

Outcome-Space Branch and Bound Algorithm for Solving Linear Multiplicative Programming.
Proceedings of the Computational Intelligence and Security, International Conference, 2005

An Algorithm for Portfolio's Value at Risk Based on Principal Factor Analysis.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

A Continuous Method for Solving Multiuser Detection in CDMA.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Properties of Hadamard product of inverse <i>M</i>-matrices.
Numer. Linear Algebra Appl., 2004

2001
Simple robust output-feedback controller for uncertain nonlinear systems.
IEEE Trans. Autom. Control., 2001

Adaptive nonlinear control with partial overparametrization.
Syst. Control. Lett., 2001

A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization.
Ann. Oper. Res., 2001

1999
A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization.
SIAM J. Optim., 1999

Trust region dogleg path algorithms for unconstrained minimization.
Ann. Oper. Res., 1999


  Loading...