Unconstrained duals to partially separable constrained programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3898623 (Why is no real title available?)
- scientific article; zbMATH DE number 3274217 (Why is no real title available?)
- A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
- A dual algorithm for convex-concave data smoothing by cubic C^ 2- splines
- An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
- Convex Analysis
- Convex spline interpolants with minimal curvature
- Determination of shape preserving spline interpolants with minimal curvature via dual programs
- Dual algorithms for solving convex partially separable optimization problems
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Lagrange multipliers and nonlinear programming
- On the existence of convex decompositions of partially separable functions
- On tridiagonal linear complementarity problems
- Positivity of cubic polynomials on intervals and positive spline interpolation
Cited in
(5)- Convex interval interpolation with cubic splines. II
- Semidefinite program duals for separable polynomial programs involving box constraints
- Dual algorithms for solving convex partially separable optimization problems
- A dual algorithm for convex-concave data smoothing by cubic C^ 2- splines
- scientific article; zbMATH DE number 4060644 (Why is no real title available?)
This page was built for publication: Unconstrained duals to partially separable constrained programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196186)
