( en | de | ru )

 

Disambiguation of "Pérez-Aros, Pedro"

Author of the publication

copydeleteadd this publication to your clipboard
Determination of convex functions via subgradients of minimal norm.

, , and . Math. Program., 190 (1): 561-583 (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pedro José Pérez Martínez

Ema Pérez Bravo

José Guadalupe Pérez-Ramírez

Elsa Pérez Rodriguez

Fabián Pérez Willard

 

Other publications of authors with the same name

Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints., and . SIAM J. Optimization, 29 (3): 2179-2210 (2019)Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming., and . SIAM J. Optim., 31 (3): 1635-1657 (2021)Random Multifunctions as Set Minimizers of Infinitely Many Differentiable Random Functions., , and . J. Optim. Theory Appl., 198 (1): 86-110 (July 2023)Optimality Conditions in DC-Constrained Mathematical Programming Problems., , and . J. Optim. Theory Appl., 198 (3): 1191-1225 (September 2023)Subdifferential characterization of probability functions under Gaussian distribution., , and . Math. Program., 174 (1-2): 167-194 (2019)Subdifferential Calculus Rules for Possibly Nonconvex Integral Functions., , and . SIAM J. Control and Optimization, 58 (1): 462-484 (2020)Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions.. SIAM J. Optimization, 29 (2): 1714-1743 (2019)On the Klee-Saint Raymond's Characterization of Convexity., , and . SIAM J. Optimization, 26 (2): 1312-1321 (2016)New extremal principles with applications to stochastic and semi-infinite programming., and . Math. Program., 189 (1): 527-553 (2021)Determination of convex functions via subgradients of minimal norm., , and . Math. Program., 190 (1): 561-583 (2021)