Well-posedness and primal-dual analysis of some convex separable optimization problems
From MaRDI portal
Publication:1953228
DOI10.1155/2013/279030zbMath1264.90142OpenAlexW1989952827WikidataQ58919064 ScholiaQ58919064MaRDI QIDQ1953228
Publication date: 7 June 2013
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/279030
Related Items (3)
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory ⋮ A note on primal-dual stability in infinite linear programming
Cites Work
- Well-posed optimization problems
- Method for solving a convex integer programming problem
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
- Convex separable minimization problems with a linear constraint and bounded variables
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
- A New Approach to Lagrange Multipliers
- Variational Analysis
- Another Proof that Convex Functions are Locally Lipschitz
- Convex separable minimization subject to bounded variables
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Well-posedness and primal-dual analysis of some convex separable optimization problems
