Well-posedness and primal-dual analysis of some convex separable optimization problems

DOI10.1155/2013/279030MaRDI QIDQ1953228zbMATH OpenOpenAlexDBLPWikidataFDO

Authors S. M. Stefanov

Publication date 7 June 2013

Published in Advances in Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/279030

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Constrained convex optimization problems-well-posedness and stability^*
• scientific article; zbMATH DE number 1099082
• Levitin-Polyak type well-posedness in constrained optimization
• scientific article; zbMATH DE number 2212210
• scientific article; zbMATH DE number 4013408

Cites work

• scientific article; zbMATH DE number 3822540 (Why is no real title available?)
• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 47297 (Why is no real title available?)
• scientific article; zbMATH DE number 2124285 (Why is no real title available?)
• scientific article; zbMATH DE number 3227637 (Why is no real title available?)
• scientific article; zbMATH DE number 3077999 (Why is no real title available?)
• A New Approach to Lagrange Multipliers
• An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
• Another Proof that Convex Functions are Locally Lipschitz
• Convex separable minimization problems with a linear constraint and bounded variables
• Convex separable minimization subject to bounded variables
• Method for solving a convex integer programming problem
• Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
• Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
• Solution of some convex separable resource allocation and production planning problems with bounds on the variables
• Variational Analysis
• Well-posed optimization problems

Cited in

(3)

• A note on primal-dual stability in infinite linear programming
• 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

This page was built for publication: Well-posedness and primal-dual analysis of some convex separable optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1953228)