Image de couverture de livre

Length-minimizing LED Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Remešíková, Mariana Sarkociová, Sarkoci, Peter, Trnovská, Mária
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Populations and Evolution 05C05, 05C90, 00A69, 90C26, 49K99
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Graph Diffusion Algorithm for Lexical Similarity Evaluation
par: Mikula, Karol, et autres
Publié: (2025)

An Adaptive Order Caputo Fractional Gradient Descent Method for Multi-objective Optimization Problems
par: Shaw, Barsha, et autres
Publié: (2025)

A Jacobi-type Newton method for Nash equilibrium problems with descent guarantees
par: Kolossoski, Oliver, et autres
Publié: (2022)

Adaptive Dimension Reduction for Overlapping Group Sparsity
par: Bai, Yifan, et autres
Publié: (2026)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
par: Li, Wenjing, et autres
Publié: (2023)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
par: Kabgani, Alireza, et autres
Publié: (2025)

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

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
par: Goldfarb, Donald, et autres
Publié: (2025)

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

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

A Cubic Regularization Method for Multiobjective Optimization
par: Gonçalves, Douglas S., et autres
Publié: (2025)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
par: Bai, Xiaoning, et autres
Publié: (2024)

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
par: Marumo, Naoki, et autres
Publié: (2026)

A full splitting algorithm for fractional programs with structured numerators and denominators
par: Boţ, Radu Ioan, et autres
Publié: (2023)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
par: Zhang, Minxin, et autres
Publié: (2024)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
par: Han, Deren, et autres
Publié: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
par: Scheinberg, Katya, et autres
Publié: (2023)

A Refined Proximal Algorithm for Nonconvex Multiobjective Optimization in Hilbert Spaces
par: Bento, G. C., et autres
Publié: (2024)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
par: Borgwardt, Steffen, et autres
Publié: (2025)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
par: Jin, Ruinan, et autres
Publié: (2026)

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
par: Clow, Alexander, et autres
Publié: (2025)

Strongly-polynomial time and validation analysis of policy gradient methods
par: Ju, Caleb, et autres
Publié: (2024)

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
par: Thieu, Nguyen Nang, et autres
Publié: (2026)

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

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

Time-integrated Optimal Transport: A Robust Minimax Framework
par: Nguyen, Thai P. D., et autres
Publié: (2025)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
par: Braun, Gábor, et autres
Publié: (2024)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
par: Singh, Vikram, et autres
Publié: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
par: Xie, Xiyuan, et autres
Publié: (2025)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
par: Marumo, Naoki, et autres
Publié: (2023)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
par: Lin, Yizun, et autres
Publié: (2024)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
par: Kannan, Rohit, et autres
Publié: (2022)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
par: Xie, Lijun, et autres
Publié: (2025)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
par: Xie, Xiyuan, et autres
Publié: (2026)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
par: Gfrerer, H.
Publié: (2024)

A double-pivot degenerate-robust simplex algorithm for linear programming
par: Yang, Yaguang, et autres
Publié: (2021)

On the facet pivot simplex method for linear programming
par: Yang, Yaguang
Publié: (2021)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
par: Hu, Yaling, et autres
Publié: (2026)