Pages that link to "Item:Q1356051"
From MaRDI portal
The following pages link to Separating plane algorithms for convex optimization (Q1356051):
Displaying 10 items.
- Maximum consistency method for data fitting under interval uncertainty (Q330508) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- Maximum compatibility method for data fitting under interval uncertainty (Q1647406) (← links)
- A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence (Q1733318) (← links)
- Computational experience and challenges with the conjugate epi-projection algorithms for non-smooth optimization (Q1982928) (← links)
- Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
- Algorithmes de type F.A.C. en optimisation convexe (Q4698894) (← links)
- Fast Combinatorial Algorithm for Tightly Separating Hyperplanes (Q4912422) (← links)
- A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
- Weak and Strong Compatibility in Data Fitting Problems Under Interval Uncertainty (Q5858141) (← links)