Branch-and-Cut for Nonlinear Power Systems Problems
暂无分享,去创建一个
[1] Toshiki Sato,et al. Feature subset selection for logistic regression via mixed integer optimization , 2016, Comput. Optim. Appl..
[2] Chee-Khian Sim,et al. A note on treating a second order cone program as a special case of a semidefinite program , 2005, Math. Program..
[3] Claudio Gentile,et al. Solving unit commitment problems with general ramp constraints , 2008 .
[4] Christian Kirches,et al. Mixed-integer nonlinear optimization*† , 2013, Acta Numerica.
[5] Robert E. Bixby,et al. Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..
[6] Alper Atamtürk,et al. Conic mixed-integer rounding cuts , 2009, Math. Program..
[7] François Glineur,et al. Topics in Convex Optimization: Interior-Point Methods, Conic Duality and Approximations , 2001 .
[8] Maw-Sheng Chern,et al. On the computational complexity of reliability redundancy allocation in a series system , 1992, Oper. Res. Lett..
[9] Anthony Papavasiliou,et al. Economic analysis of the N-1 reliable unit commitment and transmission switching problem using duality concepts , 2010 .
[10] Bo Zeng,et al. Robust unit commitment problem with demand response and wind energy , 2012, PES 2012.
[11] S. Oren,et al. Optimal Transmission Switching—Sensitivity Analysis and Extensions , 2008, IEEE Transactions on Power Systems.
[12] Jeff T. Linderoth. A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs , 2005, Math. Program..
[13] Claudio Gentile,et al. A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes , 2009, Oper. Res. Lett..
[14] T. Tao. Topics in Random Matrix Theory , 2012 .
[15] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[16] R. Saigal,et al. Handbook of semidefinite programming : theory, algorithms, and applications , 2000 .
[17] T. A. Bray,et al. OPTIMUM REDUNDANCY UNDER MULTIPLE CONSTRAINTS , 1965 .
[18] Hong-Tzer Yang,et al. Evolutionary programming based economic dispatch for units with non-smooth fuel cost functions , 1996 .
[19] C Zener,et al. A MATHEMATICAL AID IN OPTIMIZING ENGINEERING DESIGNS. , 1961, Proceedings of the National Academy of Sciences of the United States of America.
[20] Daniel Pérez Palomar,et al. Randomized Algorithms for Optimal Solutions of Double-Sided QCQP With Applications in Signal Processing , 2014, IEEE Transactions on Signal Processing.
[21] Kees Roos,et al. Extended Matrix Cube Theorems with Applications to µ-Theory in Control , 2003, Math. Oper. Res..
[22] Jesse T. Holzer,et al. Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite Programming , 2013, IEEE Transactions on Power Systems.
[23] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.
[24] Andrew L. Ott,et al. Evolution of computing requirements in the PJM market: Past and future , 2010, IEEE PES General Meeting.
[25] Pierre Bonami,et al. On mathematical programming with indicator constraints , 2015, Math. Program..
[26] Masakazu Kojima,et al. Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion , 2011, Math. Program..
[27] Thomas Rothvoß,et al. Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..
[28] Kazuo Murota,et al. Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , 2000, SIAM J. Optim..
[29] Johan Löfberg,et al. YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .
[30] Robert R. Meyer,et al. On the existence of optimal solutions to integer and mixed-integer programming problems , 1974, Math. Program..
[31] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[32] Etienne de Klerk,et al. The complexity of optimizing over a simplex, hypercube or sphere: a short survey , 2008, Central Eur. J. Oper. Res..
[33] K. Mani Chandy,et al. Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow , 2012, IEEE Transactions on Control of Network Systems.
[34] Fabio Tardella,et al. Existence and sum decomposition of vertex polyhedral convex envelopes , 2008, Optim. Lett..
[35] Daniel Bienstock,et al. Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets , 2014, SIAM J. Optim..
[36] Alper Atamtürk,et al. Polymatroids and mean-risk minimization in discrete optimization , 2008, Oper. Res. Lett..
[37] David G. Luenberger,et al. Linear and nonlinear programming , 1984 .
[38] Ignacio E. Grossmann,et al. Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation , 2003, Comput. Optim. Appl..
[39] George L. Nemhauser,et al. A branch-and-cut algorithm for nonconvex quadratic programs with box constraints , 2005, Math. Program..
[40] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.
[41] J. Gallier. Quadratic Optimization Problems , 2020, Linear Algebra and Optimization with Applications to Machine Learning.
[42] Nikolaos V. Sahinidis,et al. Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs , 2009, Optim. Methods Softw..
[43] Igor Klep,et al. An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares , 2012, Math. Oper. Res..
[44] D. Streiffert,et al. A mixed integer programming solution for market clearing and reliability analysis , 2005, IEEE Power Engineering Society General Meeting, 2005.
[45] Yong Fu,et al. Security-constrained unit commitment with AC constraints , 2005, IEEE Transactions on Power Systems.
[46] Stephen P. Boyd,et al. An Interior-Point Method for Large-Scale l1-Regularized Logistic Regression , 2007, J. Mach. Learn. Res..
[47] Jon Lee,et al. Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations , 2010, Math. Program..
[48] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[49] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[50] George L. Nemhauser,et al. How important are branching decisions: Fooling MIP solvers , 2015, Oper. Res. Lett..
[51] Martin D. Davis. Hilbert's Tenth Problem is Unsolvable , 1973 .
[52] R. Sioshansi,et al. Economic Consequences of Alternative Solution Methods for Centralized Unit Commitment in Day-Ahead Electricity Markets , 2008, IEEE Transactions on Power Systems.
[53] S. Low,et al. Zero Duality Gap in Optimal Power Flow Problem , 2012, IEEE Transactions on Power Systems.
[54] Gerald B. Sheblé,et al. Unit commitment literature synopsis , 1994 .
[55] Hanif D. Sherali,et al. A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..
[56] N.P. Padhy,et al. Unit commitment-a bibliographical survey , 2004, IEEE Transactions on Power Systems.
[57] Santanu S. Dey,et al. Inexactness of SDP Relaxation for Optimal Power Flow over Radial Networks and Valid Inequalities for Global Optimization , 2014 .
[58] Fangxing Li,et al. DCOPF-Based LMP simulation: algorithm, comparison with ACOPF, and sensitivity , 2007, 2008 IEEE/PES Transmission and Distribution Conference and Exposition.
[59] Nikolaos V. Sahinidis,et al. BARON: A general purpose global optimization software package , 1996, J. Glob. Optim..
[60] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[61] Thorsten Koch,et al. Branching rules revisited , 2005, Oper. Res. Lett..
[62] D. Bertsekas,et al. Optimal short-term scheduling of large-scale power systems , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[63] Donald Goldfarb,et al. Second-order cone programming , 2003, Math. Program..
[64] Shmuel S. Oren,et al. Efficiency impact of convergence bidding in the california electricity market , 2015 .
[65] Richard E. Korf,et al. Performance of Linear-Space Search Algorithms , 1995, Artif. Intell..
[66] Kory W Hedman,et al. Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability , 2010, IEEE Transactions on Power Systems.
[67] Nikolaos V. Sahinidis,et al. Convex extensions and envelopes of lower semi-continuous functions , 2002, Math. Program..
[68] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[69] David Tse,et al. Geometry of feasible injection region of power networks , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[70] Antonio De Maio,et al. Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint , 2011, IEEE Transactions on Signal Processing.
[71] Oktay Günlük,et al. Perspective reformulations of mixed integer nonlinear programs with indicator variables , 2010, Math. Program..
[72] Pietro Belotti,et al. Linear Programming Relaxations of Quadratically Constrained Quadratic Programs , 2012, ArXiv.
[73] Klaus Kleibohm,et al. Bemerkungen zum Problem der nichtkonvexen Programmierung , 1967, Unternehmensforschung.
[74] M. Shahidehpour,et al. Security-Constrained Unit Commitment With AC/DC Transmission Systems , 2010, IEEE Transactions on Power Systems.
[75] Abhinav Verma,et al. Power grid security analysis: an optimization approach , 2010 .
[76] Anastasios G. Bakirtzis,et al. A genetic algorithm solution to the unit commitment problem , 1996 .
[77] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Feature Subset Selection , 1977, IEEE Transactions on Computers.
[78] Ulrich Raber,et al. A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs , 1998, J. Glob. Optim..
[79] S. Oren,et al. Analyzing valid inequalities of the generation unit commitment problem , 2009, 2009 IEEE/PES Power Systems Conference and Exposition.
[80] Zuwei Yu. A spatial mean-variance MIP model for energy market risk analysis , 2003 .
[81] Sanjeev Khanna,et al. A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..
[82] John E. Mitchell,et al. A second-order cone cutting surface method: complexity and application , 2009, Comput. Optim. Appl..
[83] Timo Berthold,et al. Rounding and Propagation Heuristics for Mixed Integer Programming , 2011, OR.
[84] Michael J. Todd,et al. Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems , 1999, Math. Program..
[85] John E. Mitchell,et al. Polynomial Interior Point Cutting Plane Methods , 2003, Optim. Methods Softw..
[86] R D Zimmerman,et al. MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.
[87] Jean Charles Gilbert,et al. Application of the Moment-SOS Approach to Global Optimization of the OPF Problem , 2013, IEEE Transactions on Power Systems.
[88] Hans Raj Tiwary,et al. Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.
[89] M. Mazumdar,et al. Use of Geometric Programming to Maximize Reliability Achieved by Redundancy , 1968, Oper. Res..
[90] R. Jabr. Robust self-scheduling under price uncertainty using conditional value-at-risk , 2005, IEEE Transactions on Power Systems.
[91] Ignacio E. Grossmann,et al. An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..
[92] C.R. Philbrick,et al. Modeling Approaches for Computational Cost Reduction in Stochastic Unit Commitment Formulations , 2010, IEEE Transactions on Power Systems.
[93] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[94] A. Nemirovski. Advances in convex optimization : conic programming , 2002 .
[95] Jean B. Lasserre,et al. Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..
[96] R. Jabr. Exploiting Sparsity in SDP Relaxations of the OPF Problem , 2012, IEEE Transactions on Power Systems.
[97] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[98] Günther R. Raidl,et al. Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.
[99] P. Luh,et al. Optimal integrated generation bidding and scheduling with risk management under a deregulated daily power market , 2002, 2002 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.02CH37309).
[100] Ralf Gollmer,et al. Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods , 2009, Oper. Res..
[101] C. Gentile,et al. Tighter Approximated MILP Formulations for Unit Commitment Problems , 2009, IEEE Transactions on Power Systems.
[102] Parikshit Shah,et al. Conic geometric programming , 2013, 2014 48th Annual Conference on Information Sciences and Systems (CISS).
[103] Samuel Burer,et al. Computable representations for convex hulls of low-dimensional quadratic forms , 2010, Math. Program..
[104] Kurt M. Anstreicher,et al. Institute for Mathematical Physics Semidefinite Programming versus the Reformulation–linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming Semidefinite Programming versus the Reformulation-linearization Technique for Nonconvex Quadratically Constrained , 2022 .
[105] Jieping Ye,et al. Large-scale sparse logistic regression , 2009, KDD.
[106] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[107] Stephen P. Boyd,et al. A tutorial on geometric programming , 2007, Optimization and Engineering.
[108] Lorenz T. Biegler,et al. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..
[109] George L. Nemhauser,et al. A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs , 2008, INFORMS J. Comput..
[110] Robert M. Freund,et al. Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm , 1999, SIAM J. Optim..
[111] Christos H. Papadimitriou,et al. On the complexity of integer programming , 1981, JACM.
[112] Zuyi Li,et al. Risk-Constrained Bidding Strategy With Stochastic Unit Commitment , 2007, IEEE Transactions on Power Systems.
[113] Ran Quan,et al. A two-stage method with mixed integer quadratic programming for unit commitment with ramp constraints , 2008, 2008 IEEE International Conference on Industrial Engineering and Engineering Management.
[114] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[115] Knud D. Andersen,et al. The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm , 2000 .
[116] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[117] Sebastián Ceria,et al. Convex programming for disjunctive convex optimization , 1999, Math. Program..