Convex minimization problems with weak constraint qualifications
From MaRDI portal
Abstract: One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak or without constraint qualifications. The main idea is to work with intrinsic topologies which reflect some geometry of the objective function. The abstract results of this article are applied in other papers to the Monge-Kantorovich optimal transport problem and the minimization of entropy functionals.
Recommendations
- A constraint qualification for convex programming
- Convex optimization problems with constraints
- Convex minimization under Lipschitz constraints
- Sufficient global optimality conditions for weakly convex minimization problems
- Concave minimization under linear constraints with special structure
- Convex separable minimization problems with a linear constraint and bounded variables
- Generalized weak sharp minima in cone-constrained convex optimization with applications
- A simple constraint qualification in convex programming
- scientific article; zbMATH DE number 1760547
- On minimization subject to cone constraints
Cited in
(14)- A note on weakly active constraints in connection with nonconvex quadratic programming
- Orlicz space regularization of continuous optimal transport problems
- Entropic regularization of continuous optimal transport problems
- Newton-type methods: a broader view
- Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption
- Robust utility maximization without model compactness
- Entropic projections and dominating points
- A saddle-point approach to the Monge-Kantorovich optimal transport problem
- scientific article; zbMATH DE number 3895744 (Why is no real title available?)
- On duality-separability-relations
- Duality Relationships for Entropy-Like Minimization Problems
- Strong convexity of sandwiched entropies and related optimization problems
- Minimization of energy functionals applied to some inverse problems
- Minimization of entropy functionals
This page was built for publication: Convex minimization problems with weak constraint qualifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550734)
