Modified dual scheme for finite-dimensional and infinite-dimensional convex optimization problems
From MaRDI portal
Publication:4571817
Recommendations
- A comparison of alternative c-conjugate dual problems in infinite convex optimization
- A dual regularized method in convex finite-dimensional optimization problems
- Convex optimization in infinite dimensional spaces
- The Lagrange multiplier method in the finite convex programming problem
- Duality and infinite dimensional optimization
Cites work
- scientific article; zbMATH DE number 3852804 (Why is no real title available?)
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- scientific article; zbMATH DE number 4066614 (Why is no real title available?)
- Sensitivity functionals in convex optimization problem
- Sensitivity functionals in variational inequalities of mechanics and their applications to duality schemes
- The Lagrange multiplier method in the finite convex programming problem
Cited in
(2)
This page was built for publication: Modified dual scheme for finite-dimensional and infinite-dimensional convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571817)