A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
From MaRDI portal
Publication:929614
DOI10.1016/j.cam.2007.02.026zbMath1160.65029OpenAlexW2044492736MaRDI QIDQ929614
Chen Ling, Xiaojiao Tong, Liqun Qi
Publication date: 17 June 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.02.026
convergencenumerical examplessemi-infinite programmingquasi-Newton algorithmoptimal power flowtransient stability constraint
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ Recent contributions to linear semi-infinite optimization ⋮ Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults ⋮ A smoothing SQP method for nonlinear programs with stability constraints arising from power systems ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ New approach for the nonlinear programming with transient stability constraints arising from power systems ⋮ On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints ⋮ Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Semismooth Newton methods for solving semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- Smoothing Newton and quasi-Newton methods for mixed complementarity problems
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- An iterative method for solving KKT system of the semi-infinite programming
- On the Global Convergence of Broyden's Method
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Optimal operation solutions of power systems with transient stability constraints
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- Sufficient conditions for extremum, penalty functions and regularity
- Computational discretization algorithms for functional inequality constrained optimization
- Semi-infinite programming. Recent advances
- Discretization in semi-infinite programming: the rate of convergence
This page was built for publication: A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints