:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ramachandran, Akshay, Shu, Kevin, Wang, Alex L.
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control 90C22, 90C26, 70G65, 52A41
Accès en ligne:	https://arxiv.org/abs/2304.08596
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Forward-Backward algorithms for weakly convex problems
par: Bednarczuk, Ewa, et autres
Publié: (2023)

Convergence rates of S.O.S hierarchies for polynomial semidefinite programs
par: Tran, Hoang Anh, et autres
Publié: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
par: Kabgani, Alireza, et autres
Publié: (2025)

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
par: Xu, Chen, et autres
Publié: (2023)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
par: Peiris, Vinesha, et autres
Publié: (2026)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
par: Zhang, Na, et autres
Publié: (2025)

Barrier relaxations of the classical and quantum optimal transport problems
par: Friedland, Shmuel
Publié: (2025)

A multiscale Consensus-Based algorithm for multi-level optimization
par: Herty, Michael, et autres
Publié: (2024)

An optimal lower bound for smooth convex functions
par: Florea, Mihai I., et autres
Publié: (2024)

A truncated epsilon-subdifferential method for global DC optimization
par: Bagirov, Adil M., et autres
Publié: (2025)

Range of optimal values in absolute value linear programming with interval data
par: Hladík, Milan
Publié: (2025)

Error estimate for regularized optimal transport problems via Bregman divergence
par: Morikuni, Keiichi, et autres
Publié: (2023)

Geometric commutation principle for weakly spectral sets in Euclidean Jordan algebras
par: Jeong, Juyoung
Publié: (2024)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
par: Jung, Woosuk L., et autres
Publié: (2023)

${\varepsilon}$-optimality in reverse convex optimization
par: Maghri, M. El, et autres
Publié: (2025)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
par: Fest, Jean-Baptiste, et autres
Publié: (2023)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
par: Brosch, Daniel, et autres
Publié: (2025)

Measuring dissimilarity between convex cones by means of max-min angles
par: de Oliveira, Welington, et autres
Publié: (2025)

Sparse convex relaxations in polynomial optimization
par: Averkov, Gennadiy, et autres
Publié: (2024)

On the convexity for the range set of two quadratic functions
par: Nguyen, Huu-Quang, et autres
Publié: (2025)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
par: Van Tuyen, Nguyen, et autres
Publié: (2024)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
par: Murota, Kazuo, et autres
Publié: (2025)

Application and issues in abstract convexity
par: Millán, Reinier Díaz, et autres
Publié: (2022)

Riemannian Trust Region Methods for SC$^1$ Minimization
par: Zhang, Chenyu, et autres
Publié: (2023)

Spectrally Constrained Optimization
par: Garner, Casey, et autres
Publié: (2023)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
par: Li, Hanyang, et autres
Publié: (2025)

Inexact Limited Memory Bundle Method
par: Lampainen, Jenni, et autres
Publié: (2026)

General Constrained Matrix Optimization
par: Garner, Casey, et autres
Publié: (2024)

Moreau envelope and proximal-point methods under the lens of high-order regularization
par: Kabgani, Alireza, et autres
Publié: (2025)

The Boolean polynomial polytope with multiple choice constraints
par: Shao, Sihong, et autres
Publié: (2024)

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints
par: Quan, Vu Hong, et autres
Publié: (2025)

Normal cones to sublevel sets of convex and quasi-convex supremum functions
par: Caro, Stephanie, et autres
Publié: (2026)

Characterization theorem for best polynomial spline approximation with free knots
par: Sukhorukova, Nadezda, et autres
Publié: (2014)

A quadratically convergent proximal algorithm for nonnegative tensor decomposition
par: Vervliet, Nico, et autres
Publié: (2020)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
par: Kabgani, Alireza, et autres
Publié: (2024)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
par: Alpay, Faruk, et autres
Publié: (2025)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
par: Tauheed, et autres
Publié: (2026)

On generators of $k$-PSD closures of the positive semidefinite cone
par: Bhardwaj, Avinash, et autres
Publié: (2024)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
par: Atenas, Felipe
Publié: (2023)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
par: Atenas, Felipe
Publié: (2025)