Choong Ming Chin
Research Subjects
Research Interests
Choong Ming Chin has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Gilbert Owusu
British Telecom
2 shared publications - Siddhartha Shakya
Research and Innovation, BT Technology, Services and Operations
2 shared publications Abdul Halim Abdul Rashid
Mathematical Sciences Institute, University of Malaya , Pantai Valley, Kuala Lumpur, 50603, Malaysia
1 shared publicationKhalid Mohamed Nor
Department of Electrical Engineering , Technological University of Malaysia , Skudai, 81310, Johor, Malaysia
1 shared publication- Mathias Kern
BT Applied Research
1 shared publication
Latest Publications
- 29 October 2010
- Published by Springer Nature
- p. 223-236
Dynamic Pricing with Neural Network Demand Models and Evolutionary Algorithms
- 29 October 2010
- Published by Springer Nature
- p. 223-236
Dynamic Pricing with Neural Network Demand Models and Evolutionary Algorithms
- 19 October 2009
- Published by Springer Nature
- p. 393-406
An AI-Based System for Pricing Diverse Products and Services
- 19 October 2009
- Published by Springer Nature
- p. 393-406
An AI-Based System for Pricing Diverse Products and Services
- 21 March 2007
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 22 (3) , 365-390
Global and local convergence of a filter line search method for nonlinear programming
A framework for proving global convergence for a class of line search filter-type methods for nonlinear programming is presented without assuming that the Jacobian has full rank everywhere. The underlying method is based on the filter concept where trial points are accepted, provided there is a sufficient decrease in the objective function or constraints violation function. The proposed methods solve a sequence of quadratic programming subproblems via line search techniques to induce global convergence. Under mild conditions, we will also show that the algorithm converges two step superlinearly when the iterates are near to the solution.
- 21 March 2007
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 22 (3) , 365-390
Global and local convergence of a filter line search method for nonlinear programming
A framework for proving global convergence for a class of line search filter-type methods for nonlinear programming is presented without assuming that the Jacobian has full rank everywhere. The underlying method is based on the filter concept where trial points are accepted, provided there is a sufficient decrease in the objective function or constraints violation function. The proposed methods solve a sequence of quadratic programming subproblems via line search techniques to induce global convergence. Under mild conditions, we will also show that the algorithm converges two step superlinearly when the iterates are near to the solution.