Pages that link to "Item:Q489076"
From MaRDI portal
The following pages link to Lagrange-type duality in DC programming (Q489076):
Displaying 9 items.
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
- Lagrange-type duality in DC programming problems with equivalent DC inequalities (Q340375) (← links)
- Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces (Q824790) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Split proximal linearized algorithm and convergence theorems for the split DC program (Q2067889) (← links)
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems (Q4639126) (← links)
- On Lagrange Duality for Several Classes of Nonconvex Optimization Problems (Q5214420) (← links)
- A forward-backward algorithm for the DC programming in Hilbert spaces (Q5244142) (← links)
- Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
