Well-posedness and primal-dual analysis of some convex separable optimization problems
Summary: We focus on some convex separable optimization problems, considered by the author in previous papers, for which problems, necessary and sufficient conditions or sufficient conditions have been proved, and convergent algorithms of polynomial computational complexity have been proposed for solving these problems. The concepts of well-posedness of optimization problems in the sense of Tychonov, Hadamard, and in a generalized sense, as well as calmness in the sense of Clarke, are discussed. It is shown that the convex separable optimization problems under consideration are calm in the sense of Clarke. The concept of stability of the set of saddle points of the Lagrangian in the sense of Gol'shtein is also discussed, and it is shown that this set is not stable for the ``classical Lagrangian. However, it turns out that despite this instability, due to the specificity of the approach, suggested by the author for solving problems under consideration, it is not necessary to use modified Lagrangians but only the ``classical Lagrangians. Also, a primal-dual analysis for problems under consideration in view of methods for solving them is presented.
- 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
- 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?)
- 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
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)
