Imagen de Portada

Relaxation via Separable Estimators: Arithmetic and Implementation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zha, Yanlin, Villanueva, Mario Eduardo, Houska, Boris, Chachuat, Benoît
Formato:	Preprint
Publicado:	2026
Materias:	Numerical Analysis Optimization and Control 26B40, 41A30, 90C26, 90C59
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
por: Qu, Zheng, et al.
Publicado: (2023)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
por: Hamana, Shodai, et al.
Publicado: (2026)

Parabolic Approximation & Relaxation for MINLP
por: Göß, Adrian, et al.
Publicado: (2024)

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

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
por: Göß, Adrian
Publicado: (2026)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
por: de Brito, José, et al.
Publicado: (2025)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
por: Khanh, Phan Quoc, et al.
Publicado: (2025)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
por: Alcantara, Jan Harold, et al.
Publicado: (2024)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
por: de Brito, Jose, et al.
Publicado: (2026)

A heavy-ball type curve search method for smooth convexly constrained optimization
por: Donnini, Federica, et al.
Publicado: (2026)

Characterizations of Strongly Quasiconvex Functions
por: Hadjisavvas, Nicolas, et al.
Publicado: (2025)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
por: Chen, Xiaojun, et al.
Publicado: (2022)

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

Optimization over convex polyhedra via Hadamard parametrizations
por: Tang, Tianyun, et al.
Publicado: (2024)

Separable QCQPs and Their Exact SDP Relaxations
por: Kojima, Masakazu, et al.
Publicado: (2026)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

Effective Front-Descent Algorithms with Convergence Guarantees
por: Lapucci, Matteo, et al.
Publicado: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
por: Jia, Xiaoxi, et al.
Publicado: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
por: Lapucci, Matteo, et al.
Publicado: (2024)

A Surrogate Value Function Formulation for Bilevel Optimization
por: Xu, Mengwei, et al.
Publicado: (2025)

A Globally Convergent Gradient Method with Momentum
por: Lapucci, Matteo, et al.
Publicado: (2024)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
por: Cesaroni, Edoardo, et al.
Publicado: (2026)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
por: Higuchi, Rei, et al.
Publicado: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
por: Cecere, Francesco, et al.
Publicado: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
por: González-Díaz, Julio, et al.
Publicado: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
por: Ghaffari-Hadigheh, Alireza, et al.
Publicado: (2022)

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

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
por: Xie, Yue, et al.
Publicado: (2025)

Accelerating Deterministic Global Optimization via GPU-parallel Interval Arithmetic
por: Zhang, Hongzhen, et al.
Publicado: (2025)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
por: Monteiro, Renato D. C., et al.
Publicado: (2024)

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

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
por: McRae, Andrew D., et al.
Publicado: (2023)

Hidden convexity of quadratic systems and its application to quadratic programming
por: Huy, Nguyen Quang, et al.
Publicado: (2026)

Riemannian Gradient Method with Momentum
por: Leggio, Filippo, et al.
Publicado: (2026)

A minimal face constant rank constraint qualification for reducible conic programming
por: Andreani, Roberto, et al.
Publicado: (2023)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
por: Göß, Adrian, et al.
Publicado: (2024)

A divergence-based condition to ensure quantile improvement in black-box global optimization
por: Guilmeau, Thomas, et al.
Publicado: (2024)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
por: Vodeb, Jaka, et al.
Publicado: (2024)

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

Global convergence of the gradient method for functions definable in o-minimal structures
por: Josz, Cédric
Publicado: (2023)