Copertina

Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Lozovanu, Dmitrii
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control 65K05, 68Q17
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

An adaptive framework for first-order gradient methods
di: Hu, Xiaozhe, et al.
Pubblicazione: (2026)

An optimally fast objective-function-free minimization algorithm using random subspaces
di: Bellavia, S., et al.
Pubblicazione: (2023)

A practical randomized trust-region method to escape saddle points in high dimension
di: Dragomir, Radu-Alexandru, et al.
Pubblicazione: (2026)

A non-iterative polynomial algorithm for linear programming
di: Jing-Yuan, Wei
Pubblicazione: (2013)

An Operator Learning Approach to Nonsmooth Optimal Control of Nonlinear PDEs
di: Song, Yongcun, et al.
Pubblicazione: (2024)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
di: Yang, Xiangyu, et al.
Pubblicazione: (2021)

Well-posedness and mean-field limit estimate of a consensus-based algorithm for min-max problems
di: Huang, Hui, et al.
Pubblicazione: (2026)

A modularized algorithmic framework for interface related optimization problems using characteristic functions
di: Wang, Dong, et al.
Pubblicazione: (2022)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
di: Cui, Jinchuan, et al.
Pubblicazione: (2022)

Retraction based regression methods on Riemannian manifolds
di: Loayza-Romero, Estefanía, et al.
Pubblicazione: (2026)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
di: Bot, Radu Ioan, et al.
Pubblicazione: (2024)

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters
di: Vidyasagar, Mathukumalli
Pubblicazione: (2025)

A network based approach for unbalanced optimal transport on surfaces
di: Pan, Jiangong, et al.
Pubblicazione: (2024)

Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies
di: Roith, Tim, et al.
Pubblicazione: (2025)

Curvature-Aware Derivative-Free Optimization
di: Kim, Bumsu, et al.
Pubblicazione: (2021)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
di: Curtis, Frank E., et al.
Pubblicazione: (2025)

A Proximal-Gradient Method for Constrained Optimization
di: Dai, Yutong, et al.
Pubblicazione: (2024)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
di: Gratton, Serge, et al.
Pubblicazione: (2026)

A particle consensus approach to solving nonconvex-nonconcave min-max problems
di: Borghi, Giacomo, et al.
Pubblicazione: (2024)

Topological structure and a polynomial-time solution of linear programming over the real numbers
di: Wei, Jing-Yuan
Pubblicazione: (2018)

An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
di: Gillis, Nicolas, et al.
Pubblicazione: (2025)

Stochastic Mirror Descent for Convex Optimization with Consensus Constraints
di: Borovykh, Anastasia, et al.
Pubblicazione: (2022)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
di: Bellavia, S., et al.
Pubblicazione: (2025)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
di: Gratton, Serge, et al.
Pubblicazione: (2024)

A new optimal control algorithm for the Keller-Segel problem
di: Guillen-Gonzalez, F., et al.
Pubblicazione: (2026)

Generalized sparsity-promoting solvers for Bayesian inverse problems: Versatile sparsifying transforms and unknown noise variances
di: Lindbloom, Jonathan, et al.
Pubblicazione: (2024)

Tracking controllability on moving targets for parabolic equations
di: Apraiz, Jone, et al.
Pubblicazione: (2026)

Fixed-Point Neural Optimal Transport without Implicit Differentiation
di: Park, Yesom, et al.
Pubblicazione: (2026)

The Pontryagin Maximum Principle for Training Convolutional Neural Networks
di: Hofmann, Sebastian, et al.
Pubblicazione: (2025)

Handbook of Convergence Theorems for (Stochastic) Gradient Methods
di: Garrigos, Guillaume, et al.
Pubblicazione: (2023)

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
di: Alves, M. Marques, et al.
Pubblicazione: (2025)

A First Step Towards Mesh-Free Probabilistic Shape Optimization
di: Schmidt, Stephan, et al.
Pubblicazione: (2026)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

A Riemannian approach for PDE-constrained shape optimization over the diffeomorphism group using outer metrics
di: Loayza-Romero, Estefania, et al.
Pubblicazione: (2025)

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
di: Burns, Matthew X., et al.
Pubblicazione: (2025)

Optimization in Theory and Practice
di: Wright, Stephen J.
Pubblicazione: (2025)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
di: Azizian, Waïss, et al.
Pubblicazione: (2022)

Convergence to good non-optimal critical points in the training of neural networks: Gradient descent optimization with one random initialization overcomes all bad non-global local minima with high probability
di: Ibragimov, Shokhrukh, et al.
Pubblicazione: (2022)

A unified approach to shape and topological sensitivity analysis of discretized optimal design problems
di: Gangl, Peter, et al.
Pubblicazione: (2022)