Copertina

Disciplined Biconvex Programming

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhu, Hao, Boedecker, Joschka
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Computational Engineering, Finance, and Science Machine Learning Mathematical Software 90C25, 90C59, 90C90
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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