Imagen de Portada

Disciplined Biconvex Programming

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhu, Hao, Boedecker, Joschka
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control Computational Engineering, Finance, and Science Machine Learning Mathematical Software 90C25, 90C59, 90C90
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Multi-convex Programming for Discrete Latent Factor Models Prototyping
por: Zhu, Hao, et al.
Publicado: (2025)

Fitting Reinforcement Learning Model to Behavioral Data under Bandits
por: Zhu, Hao, et al.
Publicado: (2025)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
por: Bolusani, Suresh, et al.
Publicado: (2024)

Tractable downfall of basis pursuit in structured sparse optimization
por: Marmary, Maya V., et al.
Publicado: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
por: Dörfler, Daniel, et al.
Publicado: (2020)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
por: Im, Haesol, et al.
Publicado: (2024)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
por: Dörfler, Daniel, et al.
Publicado: (2026)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
por: Halbig, Katrin, et al.
Publicado: (2024)

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
por: Aguirre, Jacob, et al.
Publicado: (2025)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
por: Borges, Jennifer C., et al.
Publicado: (2026)

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

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
por: Kim, Junyoung, et al.
Publicado: (2024)

MOCVXPY: a CVXPY extension for multiobjective optimization
por: Salomon, Ludovic, et al.
Publicado: (2025)

Memetic Differential Evolution Methods for Semi-Supervised Clustering
por: Mansueto, Pierluigi, et al.
Publicado: (2024)

Perpertual Coupled Simulated Annealing for Continuous Optimization
por: Gonçalves-e-Silva, Kayo, et al.
Publicado: (2018)

A Canceling Heuristic for the Directed Traveling Salesman Problem
por: Borgwardt, Steffen, et al.
Publicado: (2026)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
por: Badenbroek, Riley, et al.
Publicado: (2024)

Applying a Random-Key Optimizer on Mixed Integer Programs
por: Chaves, Antonio A., et al.
Publicado: (2026)

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
por: Liang, Ling, et al.
Publicado: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
por: Yang, Dominic, et al.
Publicado: (2025)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
por: Kempke, Nils-Christian, et al.
Publicado: (2025)

A conditional gradient homotopy method with applications to Semidefinite Programming
por: Dvurechensky, Pavel, et al.
Publicado: (2022)

Alternating minimization for square root principal component pursuit
por: Deng, Shengxiang, et al.
Publicado: (2024)

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data
por: Harris, Elizabeth, et al.
Publicado: (2024)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
por: Loris, Ignace, et al.
Publicado: (2023)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
por: Liang, Ling, et al.
Publicado: (2024)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
por: Lin, Zhenwei, et al.
Publicado: (2022)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
por: Prakhya, Karthik, et al.
Publicado: (2026)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
por: Jiang, Ruichen, et al.
Publicado: (2022)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
por: Nishioka, Akatsuki, et al.
Publicado: (2023)

A symmetric primal-dual algorithmic framework for saddle point problems
por: He, Hongjin, et al.
Publicado: (2022)

Metaheuristic algorithms for the induced P-median problem with upgrades
por: Salazar, Sergio, et al.
Publicado: (2026)

Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
por: Roth, Jake, et al.
Publicado: (2024)

Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
por: Tran-Dinh, Quoc
Publicado: (2025)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
por: Tran-Dinh, Quoc, et al.
Publicado: (2025)

Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
por: Tran-Dinh, Quoc
Publicado: (2024)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
por: Tran-Dinh, Quoc, et al.
Publicado: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
por: Kojima, Masakazu, et al.
Publicado: (2025)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
por: García-Castaño, Fernando, et al.
Publicado: (2024)

An ODE approach to multiple choice polynomial programming
por: Shao, Sihong, et al.
Publicado: (2022)