Pages that link to "Item:Q1273445"
From MaRDI portal
The following pages link to Relaxation methods for strictly convex regularizations of piecewise linear programs (Q1273445):
Displaying 7 items.
- A relaxed version of Bregman's method for convex programming (Q1067977) (← links)
- The relaxation method for certain type of pseudoconvex programming problems (Q1902802) (← links)
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement (Q2115319) (← links)
- Relaxation Methods for Linear Programs (Q3783839) (← links)
- (Q3983798) (← links)
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q3986751) (← links)
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization (Q4620420) (← links)