activity
20112022
most citedHölder Error Bounds and Hölder Calmness with Applications to Convex Semi-Infinite Optimization

21 citations · 34 across the 7 of their papers we have counts for

collaborators
Showing math.OCShow all

7 papers · 1 filter

math.OC2022★ 1 cited

Optimality conditions in DC constrained mathematical programming problems

Rafael Correa, Marco A. López, Pedro Pérez-Aros

This paper provides necessary and sufficient optimality conditions for abstract constrained mathematical programming problems in locally convex spaces under new qualification condi…

math.OC2021

Relaxed Lagrangian duality in convex infinite optimization: reverse strong duality and optimality

Nguyen Dinh, Miguel A. Goberna, Marco A. Lopez +1

We associate with each convex optimization problem posed on some locally convex space with an infinite index set T, and a given non-empty family H formed by finite subsets of T, a…

math.OC2018★ 21 cited

Hölder Error Bounds and Hölder Calmness with Applications to Convex Semi-Infinite Optimization

Alexander Kruger, Marco López, Xiaoqi Yang +1

Using techniques of variational analysis, necessary and sufficient subdifferential conditions for Hölder error bounds are investigated and some new estimates for the corresponding…

math.OC2015★ 10 cited

Perturbation of error bounds

A. Y. Kruger, M. A. López, M. A. Théra

Our aim in the current article is to extend the developments in Kruger, Ngai & Théra, SIAM J. Optim. 20(6), 3280-3296 (2010) and, more precisely, to characterize, in the Banach spa…

math.OC2013

Calmness modulus of linear semi-infinite programs

M. J. Canovas, A. Y. Kruger, M. A. Lopez +2

Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations…

math.OC2011

Quantitative Stability of Linear Infinite Inequality Systems under Block Perturbations with Applications to Convex Systems

M. J. Cánovas, M. A. LóPez, B. S. Mordukhovich +1

The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over…