Relaxation methods for strictly convex regularizations of piecewise linear programs
From MaRDI portal
Recommendations
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- A relaxed version of Bregman's method for convex programming
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
Cited in
(7)- Relaxation methods for problems with strictly convex separable costs and linear constraints
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
- Relaxation Methods for Linear Programs
- scientific article; zbMATH DE number 27284 (Why is no real title available?)
- The relaxation method for certain type of pseudoconvex programming problems
- A relaxed version of Bregman's method for convex programming
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
This page was built for publication: Relaxation methods for strictly convex regularizations of piecewise linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273445)