Marco A. López, a pioneer of continuous optimization in Spain
From MaRDI portal
Publication:2189625
DOI10.1007/s10013-020-00396-1zbMath1437.01025OpenAlexW2998303803MaRDI QIDQ2189625
Alexander Y. Kruger, Michel Théra, Maria J. Cánovas, Hoang Xuan Phu
Publication date: 16 June 2020
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10013-020-00396-1
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
- On coderivatives and Lipschitzian properties of the dual pair in optimization
- Benefit sharing in holding situations
- Calmness of the feasible set mapping for linear inequality systems
- Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
- Semi-infinite programming
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- Stability in linear optimization under perturbations of the left-hand side coefficients
- Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization
- Convex semi-infinite games
- Optimal value function in semi-infinite programming
- A theory of linear inequality systems
- On duality in semi-infinite programming and existence theorems for linear inequalities
- Recent contributions to linear semi-infinite optimization: an update
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Upper semicontinuity of the feasible set mapping for linear inequality systems
- Lower semicontinuity of the feasible set mapping of linear systems relative to their domains
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Local convergence of quasi-Newton methods under metric regularity
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Ill-posedness with respect to the solvability in linear optimization
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Metric regularity of semi-infinite constraint systems
- Simplex-Like Trajectories on Quasi-Polyhedral Sets
- Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- On the Stability of the Feasible Set in Optimization Problems
- A New Exchange Method for Convex Semi-Infinite Programming
- Penalty and Smoothing Methods for Convex Semi-Infinite Programming
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Modelos estrategicos dinamicos para mercados con precios fijos
- Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
- Valadier-like formulas for the supremum function I
- Nonlinear Optimization
- Valadier-like formulas for the supremum function II: The compactly indexed case
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability Theory for Linear Inequality Systems
- Calmness Modulus of Linear Semi-infinite Programs
- New Farkas-type constraint qualifications in convex infinite programming
- Distance to Solvability/Unsolvability in Linear Optimization
- On the core of transportation games
This page was built for publication: Marco A. López, a pioneer of continuous optimization in Spain
