Copertina

Optimal Control of a Stochastic Power System -- Algorithms and Mathematical Analysis

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wang, Zhen, Xi, Kaihua, Cheng, Aijie, Lin, Hai Xiang, van Schuppen, Jan H.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Systems and Control 93E20, 90C30, and 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Practical Implementation of a Sequential Quadratic Programming Algorithm for Nonconvex Sum-of-squares Problems
di: Olucak, Jan, et al.
Pubblicazione: (2026)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
di: de Brito, Jose, et al.
Pubblicazione: (2026)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
di: de Brito, José, et al.
Pubblicazione: (2025)

Deep Relaxation of Controlled Stochastic Gradient Descent via Singular Perturbations
di: Bardi, Martino, et al.
Pubblicazione: (2022)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
di: Alcantara, Jan Harold, et al.
Pubblicazione: (2024)

Characterizing nonconvex boundaries via scalarization
di: Ma, Jin, et al.
Pubblicazione: (2025)

Stochastic Optimal Control of an Epidemic Under Partial Information
di: Njiasse, Ibrahim Mbouandi, et al.
Pubblicazione: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
di: Higuchi, Rei, et al.
Pubblicazione: (2024)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
di: Xie, Yue, et al.
Pubblicazione: (2025)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
di: Khanh, Phan Quoc, et al.
Pubblicazione: (2025)

A heavy-ball type curve search method for smooth convexly constrained optimization
di: Donnini, Federica, et al.
Pubblicazione: (2026)

Characterizations of Strongly Quasiconvex Functions
di: Hadjisavvas, Nicolas, et al.
Pubblicazione: (2025)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
di: Menickelly, Matt, et al.
Pubblicazione: (2023)

Structure, Analysis, and Synthesis of First-Order Algorithms
di: Miller, Jared, et al.
Pubblicazione: (2026)

Optimization over convex polyhedra via Hadamard parametrizations
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
di: Quintero, Rodolfo A., et al.
Pubblicazione: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
di: Jia, Xiaoxi, et al.
Pubblicazione: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

A Surrogate Value Function Formulation for Bilevel Optimization
di: Xu, Mengwei, et al.
Pubblicazione: (2025)

A Globally Convergent Gradient Method with Momentum
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
di: Cesaroni, Edoardo, et al.
Pubblicazione: (2026)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
di: Cecere, Francesco, et al.
Pubblicazione: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
di: González-Díaz, Julio, et al.
Pubblicazione: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
di: Ghaffari-Hadigheh, Alireza, et al.
Pubblicazione: (2022)

On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials
di: Lara, Felipe, et al.
Pubblicazione: (2026)

A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems
di: Wang, Junlin, et al.
Pubblicazione: (2024)

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
di: Wang, Jun-Lin, et al.
Pubblicazione: (2024)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
di: Xie, Yue, et al.
Pubblicazione: (2024)

Average Cost Optimality of Partially Observed MDPS: Contraction of Non-linear Filters, Optimal Solutions and Approximations
di: Demirci, Yunus Emre, et al.
Pubblicazione: (2023)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
di: Qiu, Junwen, et al.
Pubblicazione: (2024)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
di: Göß, Adrian
Pubblicazione: (2026)

Parabolic Approximation & Relaxation for MINLP
di: Göß, Adrian, et al.
Pubblicazione: (2024)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
di: McRae, Andrew D., et al.
Pubblicazione: (2023)

Hidden convexity of quadratic systems and its application to quadratic programming
di: Huy, Nguyen Quang, et al.
Pubblicazione: (2026)

Riemannian Gradient Method with Momentum
di: Leggio, Filippo, et al.
Pubblicazione: (2026)

A minimal face constant rank constraint qualification for reducible conic programming
di: Andreani, Roberto, et al.
Pubblicazione: (2023)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
di: Göß, Adrian, et al.
Pubblicazione: (2024)

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs
di: Zhang, Hu, et al.
Pubblicazione: (2022)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
di: Xie, Lijun, et al.
Pubblicazione: (2025)