A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem
From MaRDI portal
Publication:1734367
DOI10.1016/j.ejor.2019.01.060zbMath1430.90585OpenAlexW2911582964WikidataQ128496091 ScholiaQ128496091MaRDI QIDQ1734367
Ricardo B. N. M. Pinheiro, Guilherme G. Lage, Geraldo R. M. da Costa
Publication date: 27 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.01.060
Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30)
Related Items
Sequencing paths of optimal control adjustments determined by the optimal reactive dispatch via Lagrange multiplier sensitivity analysis, Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fenchel-Rockafellar type duality for a non-convex non-differential optimization problem
- Convex analysis and nonlinear optimization. Theory and examples.
- Primal-dual nonlinear rescaling method for convex optimization
- Symmetric AC fuzzy power flow model
- Modified barrier functions (theory and methods)
- Nonlinear rescaling and proximal-like methods in convex optimization
- A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- A new family of penalties for augmented Lagrangian methods
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Monotone Operators and the Proximal Point Algorithm
- Perturbation des méthodes d'optimisation. Applications
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence of Proximal-Like Algorithms
- Entropy-Like Proximal Methods in Convex Programming
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Nonlinear Programming
