Copertina

Application and issues in abstract convexity

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Millán, Reinier Díaz, Sukhorukova, Nadezda, Ugon, Julien
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control 90C26, 90C90, 90C47, 65D15
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Bivariate rational approximations of the general temperature integral
di: Aghili, Alireza, et al.
Pubblicazione: (2024)

Multivariate approximation by polynomial and generalised rational functions
di: Millán, R. Díaz, et al.
Pubblicazione: (2021)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
di: Peiris, Vinesha, et al.
Pubblicazione: (2026)

Variational properties of the abstract subdifferential operator
di: Millàn, Reinier Diàz, et al.
Pubblicazione: (2022)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
di: Fest, Jean-Baptiste, et al.
Pubblicazione: (2023)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
di: Turan, Evren M., et al.
Pubblicazione: (2023)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
di: Millán, R. Díaz, et al.
Pubblicazione: (2026)

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

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
di: Jin, Ruinan, et al.
Pubblicazione: (2026)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
di: Hu, Yaling, et al.
Pubblicazione: (2026)

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
di: Zhao, Lei, et al.
Pubblicazione: (2025)

Large-Scale Minimization of the Pseudospectral Abscissa
di: Aliyev, Nicat, et al.
Pubblicazione: (2022)

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
di: Xu, Chen, et al.
Pubblicazione: (2023)

Characterization theorem for best polynomial spline approximation with free knots
di: Sukhorukova, Nadezda, et al.
Pubblicazione: (2014)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
di: Tawarmalani, Mohit
Pubblicazione: (2024)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
di: Davarnia, Danial, et al.
Pubblicazione: (2025)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
di: Anstreicher, Kurt M., et al.
Pubblicazione: (2025)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
di: Zhang, Na, et al.
Pubblicazione: (2025)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
di: Yao, Tongliang, 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)

A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems
di: Wang, Junlin, 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)

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

A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
di: Lu, Zhaosong, et al.
Pubblicazione: (2025)

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

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

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

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

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

Extragradient method with feasible inexact projection to variational inequality problem
di: Millán, R. Díaz, et al.
Pubblicazione: (2023)

Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence
di: Qiu, Junwen, et al.
Pubblicazione: (2024)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
di: Nandhan, Navil, et al.
Pubblicazione: (2026)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
di: Li, Luxuan, et al.
Pubblicazione: (2026)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
di: Krejić, Nataša, et al.
Pubblicazione: (2025)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
di: Wang, Xuejie, et al.
Pubblicazione: (2023)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
di: Guigues, Vincent, et al.
Pubblicazione: (2017)

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

On the convexity for the range set of two quadratic functions
di: Nguyen, Huu-Quang, et al.
Pubblicazione: (2025)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
di: Gómez-Casares, Ignacio, et al.
Pubblicazione: (2025)

An Extended ADMM for 3-Block Nonconvex Nonseparable Problems with Applications
di: Liu, Zekun
Pubblicazione: (2024)