Image de couverture de livre

Learning based convex approximation for constrained parametric optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Liu, Kang, Peng, Wei, Hu, Jianchen
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions
par: Liu, Kang, et autres
Publié: (2026)

Budget-aware Auto Optimizer Configurator
par: Liu, Kang, et autres
Publié: (2026)

Exact Dual Geometry of SOC-ICNN Value Functions
par: Liu, Kang, et autres
Publié: (2026)

Instance-optimal stochastic convex optimization: Can we improve upon sample-average and robust stochastic approximation?
par: Jiang, Liwei, et autres
Publié: (2026)

Derivatives of Stochastic Gradient Descent in parametric optimization
par: Iutzeler, Franck, et autres
Publié: (2024)

Non-geodesically-convex optimization in the Wasserstein space
par: Luu, Hoang Phuc Hau, et autres
Publié: (2024)

Learning solutions to some toy constrained optimization problems in infinite dimensional Hilbert spaces
par: Mandal, Pinak
Publié: (2024)

A simple uniformly optimal method without line search for convex optimization
par: Li, Tianjiao, et autres
Publié: (2023)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
par: Bodard, Alexander, et autres
Publié: (2024)

A constrained optimization approach to improve robustness of neural networks
par: Zhao, Shudian, et autres
Publié: (2024)

Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
par: Lyu, Hanbaek, et autres
Publié: (2020)

Group-blind optimal transport to group parity and its constrained variants
par: Zhou, Quan, et autres
Publié: (2023)

Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization
par: Li, Yuchen, et autres
Publié: (2023)

PACSBO: Probably approximately correct safe Bayesian optimization
par: Tokmak, Abdullah, et autres
Publié: (2024)

Bayesian Quality-Diversity approaches for constrained optimization problems with mixed continuous, discrete and categorical variables
par: Brevault, Loic, et autres
Publié: (2023)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
par: Vernimmen, Pierre, et autres
Publié: (2025)

Conditional simulation via entropic optimal transport: Toward non-parametric estimation of conditional Brenier maps
par: Baptista, Ricardo, et autres
Publié: (2024)

Learning to optimize: A tutorial for continuous and mixed-integer optimization
par: Chen, Xiaohan, et autres
Publié: (2024)

"Over-optimizing" for Normality: Budget-constrained Uncertainty Quantification for Contextual Decision-making
par: Wang, Yanyuan, et autres
Publié: (2025)

BO4IO: A Bayesian optimization approach to inverse optimization with uncertainty quantification
par: Lu, Yen-An, et autres
Publié: (2024)

Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance
par: Chen, Hongxu, et autres
Publié: (2026)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
par: Lauga, Guillaume
Publié: (2026)

Non-convex entropic mean-field optimization via Best Response flow
par: Lascu, Razvan-Andrei, et autres
Publié: (2025)

Cubic regularized subspace Newton for non-convex optimization
par: Zhao, Jim, et autres
Publié: (2024)

Derivative-free tree optimization for complex systems
par: Wei, Ye, et autres
Publié: (2024)

Online Non-convex Optimization with Long-term Non-convex Constraints
par: Pan, Shijie, et autres
Publié: (2023)

Manifold constrained steepest descent
par: Yang, Kaiwei, et autres
Publié: (2026)

A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
par: Sun, Zhenyu, et autres
Publié: (2024)

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
par: Alecsa, Cristian Daniel
Publié: (2021)

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
par: Liu, Wei, et autres
Publié: (2025)

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
par: Mai, Ngoc Hoang Anh, et autres
Publié: (2022)

A successive approximation method in functional spaces for hierarchical optimal control problems and its application to learning
par: Befekadu, Getachew K.
Publié: (2024)

Real-time optimal control of high-dimensional parametrized systems by deep learning-based reduced order models
par: Tomasetto, Matteo, et autres
Publié: (2024)

Towards a connection between the capacitated vehicle routing problem and the constrained centroid-based clustering
par: Abdellaoui, Abdelhakim, et autres
Publié: (2024)

Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
par: Cutkosky, Ashok, et autres
Publié: (2023)

Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
par: Carrasco, Pablo, et autres
Publié: (2024)

Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation
par: Kraria, Aicha, et autres
Publié: (2024)

A Convex-optimization-based Layer-wise Post-training Pruner for Large Language Models
par: Zhao, Pengxiang, et autres
Publié: (2024)

A survey on secure decentralized optimization and learning
par: Liu, Changxin, et autres
Publié: (2024)

Alignment of large language models with constrained learning
par: Zhang, Botong, et autres
Publié: (2025)