:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Lefebvre, Henri, Subramanyam, Anirudh
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C47
Accesso online:	https://arxiv.org/abs/2411.04307
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A symmetric primal-dual algorithmic framework for saddle point problems
di: He, Hongjin, et al.
Pubblicazione: (2022)

A first-order augmented Lagrangian method for constrained minimax optimization
di: Lu, Zhaosong, et al.
Pubblicazione: (2023)

Solutions of Two-stage Stochastic Minimax Problems
di: Sun, Hailin, et al.
Pubblicazione: (2025)

Finite adaptability in two-stage robust optimization: asymptotic optimality and tractability
di: Kedad-Sidhoum, Safia, et al.
Pubblicazione: (2023)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
di: Gebrie, Anteneh Getachew
Pubblicazione: (2023)

Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor
di: Alcala, James, et al.
Pubblicazione: (2025)

Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
di: K, Mishal Assif P, et al.
Pubblicazione: (2019)

An uncertainty model for positive-valued parameters with application to robust optimization
di: Tanaka, Tatsuya, et al.
Pubblicazione: (2026)

Scaling limits of multi-period distributionally robust optimization problems
di: Nendel, Max, et al.
Pubblicazione: (2025)

Neural Embedded Mixed-Integer Optimization for Location-Routing Problems
di: Kaleem, Waquar, et al.
Pubblicazione: (2024)

First-order penalty methods for bilevel optimization
di: Lu, Zhaosong, et al.
Pubblicazione: (2023)

A first-order method for nonconvex-strongly-concave constrained minimax optimization
di: Lu, Zhaosong, et al.
Pubblicazione: (2025)

Continuous models combining slacks-based measures of efficiency and super-efficiency
di: Bolos, Vicente J., et al.
Pubblicazione: (2024)

Optimizing Flexibility in Power Systems by Maximizing the Region of Manageable Uncertainties
di: Zingler, Aron, et al.
Pubblicazione: (2024)

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

A Dual Method for Minimax Quadratic Programming
di: Ren, Wenhui, et al.
Pubblicazione: (2025)

Application and issues in abstract convexity
di: Millán, Reinier Díaz, et al.
Pubblicazione: (2022)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
di: Yao, Tongliang, et al.
Pubblicazione: (2024)

Fully First-Order Methods for Decentralized Bilevel Optimization
di: Wang, Xiaoyu, 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)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
di: Jiang, Ruichen, et al.
Pubblicazione: (2022)

Splitting Algorithms for Distributionally Robust Optimization
di: Briceño-Arias, Luis, et al.
Pubblicazione: (2024)

Solving bilevel optimization via sequential minimax optimization
di: Lu, Zhaosong, et al.
Pubblicazione: (2025)

A Computational Study for Solving Decision-Dependent Robust Problems as Bilevel Optimization Problems
di: Lefebvre, Henri, et al.
Pubblicazione: (2025)

Nonlinear Conjugate Gradient Methods for Optimization of Set-Valued Mappings of Finite Cardinality
di: Ghosh, Debdas, et al.
Pubblicazione: (2024)

Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
di: Ghosh, Debdas, et al.
Pubblicazione: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
di: Nesterov, Yurii
Pubblicazione: (2025)

Saddle points in completely regular topological spaces
di: Kamburova, D., et al.
Pubblicazione: (2023)

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
di: Ma, Bohao, et al.
Pubblicazione: (2026)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
di: Hou, Di, et al.
Pubblicazione: (2025)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
di: Latafat, Puya, et al.
Pubblicazione: (2023)

Time-integrated Optimal Transport: A Robust Minimax Framework
di: Nguyen, Thai P. D., et al.
Pubblicazione: (2025)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
di: Xiaoyu, Luo, et al.
Pubblicazione: (2024)

A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
di: Thomä, Simon, et al.
Pubblicazione: (2024)

Adaptive proximal gradient methods are universal without approximation
di: Oikonomidis, Konstantinos A., et al.
Pubblicazione: (2024)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
di: Kong, Weiwei
Pubblicazione: (2022)

Robust Utility Maximization with Intractable Claims under Distributional Ambiguity: A Random Distributionally Robust Optimization Approach
di: Guan, Guohui, et al.
Pubblicazione: (2025)

A note on the complexity of two-stage stochastic linear optimization with small second stage
di: Buchheim, Christoph
Pubblicazione: (2026)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
di: Latafat, Puya, et al.
Pubblicazione: (2023)

On the optimal relaxation parameter of graph-based splitting methods for subspaces
di: Aragón-Artacho, Francisco J., et al.
Pubblicazione: (2026)