Convex minimization problems with weak constraint qualifications

Details Convex minimization problems with weak constraint qualifications Convex minimization problems with weak constraint qualifications

2007-10-08

arxiv.org/abs/0710.1463v1

Mathematics

Optimization and Control

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Convex minimization problems with weak constraint qualifications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convex minimization problems with weak constraint qualifications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex minimization problems with weak constraint qualifications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-543697