Imagen de Portada

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Tawarmalani, Mohit
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 65K05, 90C26, 90C11, 90C57
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
por: Singh, Vikram, et al.
Publicado: (2025)

Global optimization of multivariable functions satisfying the Vanderbei condition
por: Arutyunova, Natalya, et al.
Publicado: (2019)

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

Warm-starting outer approximation for parametrized convex MINLP
por: Tamm, Erik, et al.
Publicado: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
por: Zhou, Juan, et al.
Publicado: (2024)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
por: Brosch, Daniel, et al.
Publicado: (2025)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
por: Dolgopolik, M. V.
Publicado: (2021)

Randomized block proximal method with locally Lipschitz continuous gradient
por: Pérez-Aros, Pedro, et al.
Publicado: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
por: Kanzow, Christian, et al.
Publicado: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
por: Zhou, Junpeng, et al.
Publicado: (2025)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
por: Marumo, Naoki
Publicado: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
por: Deng, Kangkang, et al.
Publicado: (2024)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
por: Li, Qia, et al.
Publicado: (2024)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
por: Lin, Yizun, et al.
Publicado: (2024)

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

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
por: Xie, Xiyuan, et al.
Publicado: (2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
por: Li, Wenjing, et al.
Publicado: (2023)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
por: Marumo, Naoki, et al.
Publicado: (2023)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
por: Kannan, Rohit, et al.
Publicado: (2022)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
por: Xie, Lijun, et al.
Publicado: (2025)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
por: Xie, Xiyuan, et al.
Publicado: (2026)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
por: Jin, Ruinan, et al.
Publicado: (2024)

Learning to Choose Branching Rules for Nonconvex MINLPs
por: Berthold, Timo, et al.
Publicado: (2026)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
por: Mannel, Florian
Publicado: (2024)

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

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

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
por: Takahashi, Shota, et al.
Publicado: (2025)

Steiner Cut Dominants
por: Conforti, Michele, et al.
Publicado: (2022)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
por: Deng, Kangkang, et al.
Publicado: (2025)

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

Hybrid optimal control with mixed-integer Lagrangian methods
por: Nikitina, Viktoriya, et al.
Publicado: (2024)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
por: De Marchi, Alberto
Publicado: (2024)

Mixed-integer linearity in nonlinear optimization: a trust region approach
por: De Marchi, Alberto
Publicado: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
por: Mannel, Florian, et al.
Publicado: (2024)

A structured L-BFGS method and its application to inverse problems
por: Mannel, Florian, et al.
Publicado: (2023)

Cutting planes for signomial programming
por: Xu, Liding, et al.
Publicado: (2022)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
por: Bestuzheva, Ksenia, et al.
Publicado: (2022)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
por: Niu, Yi-Shuai, et al.
Publicado: (2018)

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

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
por: Della Santa, Francesco
Publicado: (2024)