A convex quadratic programming model for unit commitment global optimization

E-ISSN： 1931-4981|13|3|417-431

ISSN： 1931-4973

Source： IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, Vol.13, Iss.3, 2018-03, pp. : 417-431

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Iterative Convex Quadratic Approximation for Global Optimization in Protein Docking

By Marcia Roummel Mitchell Julie Rosen J.

Computational Optimization and Applications, Vol. 32, Iss. 3, 2005-12 ,pp. : 285-297

Springer Publishing Company

Access to resources Recommend Favorite

Bi-parametric convex quadratic optimization

By Ghaffari-Hadigheh Alireza Romanko Oleksandr Terlaky Tamas

Optimization Methods and Software, Vol. 25, Iss. 2, 2010-04 ,pp. : 229-245

Taylor & Francis Ltd

Access to resources Recommend Favorite

Robust Recursive Quadratic Programming Algorithm Model with Global and Superlinear Convergence Properties

By Facchinei F.

Journal of Optimization Theory and Applications, Vol. 92, Iss. 3, 1997-03 ,pp. : 543-579

Springer Publishing Company

Access to resources Recommend Favorite

Sparsity in convex quadratic programming with interior point methods

By Mészáros Csaba

Optimization Methods and Software, Vol. 21, Iss. 5, 2006-10 ,pp. : 733-745

Taylor & Francis Ltd

Access to resources Recommend Favorite

Characterization of optimal points in binary convex quadratic programming

By Recht Peter

Optimization, Vol. 56, Iss. 1-2, 2007-02 ,pp. : 39-47

Taylor & Francis Ltd

Access to resources Recommend Favorite