Invited Talk
December 15, 2015
"Global Optimization using Bernstein polynomial"
Speaker: Prof V Nataraj
Professor, ept. Mechanical Engineering, IIT Bombay, India
Abstract:
In this talk, we describe new algorithms for constrained global optimizationof mixed-integer nonlinear programming (MINLP) problems. The new algorithms are developed at IIT Bombay, and use the Bernstein polynomial form in a branch-and-bound framework. The performance of the new algorithms is tested and compared with several state-of-the-art MINLP solvers, on many test problems. A case study of a practical three spherical tank problem is also described.
Keywords: Bernstein polynomials • Branch-and-bound • Global optimization • Mixed-integer nonlinear programming
Bio:
Paluri S. V. Nataraj is a Professor of Systems and Control Engg Group at IIT Bombay. He obtained his Ph.D. from IIT Madras in process dynamics and control in 1987. He then worked in the CAD center at IIT Bombay, India for about one and half years before joining the faculty of the Systems and Control Engineering Group at IIT Bombay in 1988. He has been involved and teaching for more than 27 years at IIT Bombay.
His current research interests are in the areas of Global Optimization, Parallel Computing, Reliable Computing, and Robust and Fractional Order Control.
Prof. Nataraj has conducted many courses for various industries and organizations, such as nuclear power, space and defense research organizations. He worked on several projects for these organizations and other industries.
For More Information about Prof. V. Nataraj , Please Visit: Here
December 15, 2015
"Global Optimization using Bernstein polynomial"
Speaker: Prof V Nataraj
Professor, ept. Mechanical Engineering, IIT Bombay, India
Abstract:
In this talk, we describe new algorithms for constrained global optimizationof mixed-integer nonlinear programming (MINLP) problems. The new algorithms are developed at IIT Bombay, and use the Bernstein polynomial form in a branch-and-bound framework. The performance of the new algorithms is tested and compared with several state-of-the-art MINLP solvers, on many test problems. A case study of a practical three spherical tank problem is also described.
Keywords: Bernstein polynomials • Branch-and-bound • Global optimization • Mixed-integer nonlinear programming
Bio:
Paluri S. V. Nataraj is a Professor of Systems and Control Engg Group at IIT Bombay. He obtained his Ph.D. from IIT Madras in process dynamics and control in 1987. He then worked in the CAD center at IIT Bombay, India for about one and half years before joining the faculty of the Systems and Control Engineering Group at IIT Bombay in 1988. He has been involved and teaching for more than 27 years at IIT Bombay.
His current research interests are in the areas of Global Optimization, Parallel Computing, Reliable Computing, and Robust and Fractional Order Control.
Prof. Nataraj has conducted many courses for various industries and organizations, such as nuclear power, space and defense research organizations. He worked on several projects for these organizations and other industries.
For More Information about Prof. V. Nataraj , Please Visit: Here
"Global Optimization using Bernstein polynomial"
Speaker: Prof V Nataraj
Professor, ept. Mechanical Engineering, IIT Bombay, India
Abstract:
In this talk, we describe new algorithms for constrained global optimizationof mixed-integer nonlinear programming (MINLP) problems. The new algorithms are developed at IIT Bombay, and use the Bernstein polynomial form in a branch-and-bound framework. The performance of the new algorithms is tested and compared with several state-of-the-art MINLP solvers, on many test problems. A case study of a practical three spherical tank problem is also described.
Keywords: Bernstein polynomials • Branch-and-bound • Global optimization • Mixed-integer nonlinear programming
Bio:
Paluri S. V. Nataraj is a Professor of Systems and Control Engg Group at IIT Bombay. He obtained his Ph.D. from IIT Madras in process dynamics and control in 1987. He then worked in the CAD center at IIT Bombay, India for about one and half years before joining the faculty of the Systems and Control Engineering Group at IIT Bombay in 1988. He has been involved and teaching for more than 27 years at IIT Bombay.
His current research interests are in the areas of Global Optimization, Parallel Computing, Reliable Computing, and Robust and Fractional Order Control.
Prof. Nataraj has conducted many courses for various industries and organizations, such as nuclear power, space and defense research organizations. He worked on several projects for these organizations and other industries.
For More Information about Prof. V. Nataraj , Please Visit: Here
Speaker: Prof V Nataraj
Professor, ept. Mechanical Engineering, IIT Bombay, India
Abstract:
In this talk, we describe new algorithms for constrained global optimizationof mixed-integer nonlinear programming (MINLP) problems. The new algorithms are developed at IIT Bombay, and use the Bernstein polynomial form in a branch-and-bound framework. The performance of the new algorithms is tested and compared with several state-of-the-art MINLP solvers, on many test problems. A case study of a practical three spherical tank problem is also described.
Keywords: Bernstein polynomials • Branch-and-bound • Global optimization • Mixed-integer nonlinear programming
Bio:
Paluri S. V. Nataraj is a Professor of Systems and Control Engg Group at IIT Bombay. He obtained his Ph.D. from IIT Madras in process dynamics and control in 1987. He then worked in the CAD center at IIT Bombay, India for about one and half years before joining the faculty of the Systems and Control Engineering Group at IIT Bombay in 1988. He has been involved and teaching for more than 27 years at IIT Bombay.
His current research interests are in the areas of Global Optimization, Parallel Computing, Reliable Computing, and Robust and Fractional Order Control.
Prof. Nataraj has conducted many courses for various industries and organizations, such as nuclear power, space and defense research organizations. He worked on several projects for these organizations and other industries.
For More Information about Prof. V. Nataraj , Please Visit: Here
Professor, ept. Mechanical Engineering, IIT Bombay, India
Abstract:
In this talk, we describe new algorithms for constrained global optimizationof mixed-integer nonlinear programming (MINLP) problems. The new algorithms are developed at IIT Bombay, and use the Bernstein polynomial form in a branch-and-bound framework. The performance of the new algorithms is tested and compared with several state-of-the-art MINLP solvers, on many test problems. A case study of a practical three spherical tank problem is also described.
Keywords: Bernstein polynomials • Branch-and-bound • Global optimization • Mixed-integer nonlinear programming
Bio:
Paluri S. V. Nataraj is a Professor of Systems and Control Engg Group at IIT Bombay. He obtained his Ph.D. from IIT Madras in process dynamics and control in 1987. He then worked in the CAD center at IIT Bombay, India for about one and half years before joining the faculty of the Systems and Control Engineering Group at IIT Bombay in 1988. He has been involved and teaching for more than 27 years at IIT Bombay.
His current research interests are in the areas of Global Optimization, Parallel Computing, Reliable Computing, and Robust and Fractional Order Control.
Prof. Nataraj has conducted many courses for various industries and organizations, such as nuclear power, space and defense research organizations. He worked on several projects for these organizations and other industries.
For More Information about Prof. V. Nataraj , Please Visit: Here
Abstract:
In this talk, we describe new algorithms for constrained global optimizationof mixed-integer nonlinear programming (MINLP) problems. The new algorithms are developed at IIT Bombay, and use the Bernstein polynomial form in a branch-and-bound framework. The performance of the new algorithms is tested and compared with several state-of-the-art MINLP solvers, on many test problems. A case study of a practical three spherical tank problem is also described.
Keywords: Bernstein polynomials • Branch-and-bound • Global optimization • Mixed-integer nonlinear programming
Bio:
Paluri S. V. Nataraj is a Professor of Systems and Control Engg Group at IIT Bombay. He obtained his Ph.D. from IIT Madras in process dynamics and control in 1987. He then worked in the CAD center at IIT Bombay, India for about one and half years before joining the faculty of the Systems and Control Engineering Group at IIT Bombay in 1988. He has been involved and teaching for more than 27 years at IIT Bombay.
His current research interests are in the areas of Global Optimization, Parallel Computing, Reliable Computing, and Robust and Fractional Order Control.
Prof. Nataraj has conducted many courses for various industries and organizations, such as nuclear power, space and defense research organizations. He worked on several projects for these organizations and other industries.
For More Information about Prof. V. Nataraj , Please Visit: Here