Abstract
For the rank constrained optimization problem whose feasible set is the intersection of the rank constraint set R={X∈X∣rank(X)≤κ} and a closed convex set Ω, we establish the local (global) Lipschitzian type error bounds for estimating the distance from any X∈Ω (X∈X) to the feasible set and the solution set, under the calmness of a multifunction associated to the feasible set at the origin, which is satisfied by three classes of common rank constrained optimization problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
