Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
From MaRDI portal
Publication:4577185
DOI10.1137/16M1139564zbMath1395.49012OpenAlexW2883144884MaRDI QIDQ4577185
Li Meng, Chong Li, Yao-Hua Hu, Li Hui Peng, Jen-Chih Yao
Publication date: 17 July 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1139564
Nonsmooth analysis (49J52) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bivariate interval semi-infinite programming with an application to environmental decision-making analysis
- Finite termination of inexact proximal point algorithms in Hilbert spaces
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Subsmooth semi-infinite and infinite optimization problems
- Semi-infinite programming
- Global weak sharp minima for convex (semi-)infinite optimization problems
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- Finite termination of the proximal point algorithm
- Geometry of Banach spaces. Selected topics
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Bi-level strategies in semi-infinite programming.
- Robot trajectory planning with semi-infinite programming.
- A Gauss-Newton method for convex composite optimization
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Inexact subgradient methods for quasi-convex optimization problems
- A Semi-Infinite Programming Model In Data Envelopment Analysis
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions
- Weak Sharp Minima in Mathematical Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Metric subregularity for nonclosed convex multifunctions in normed spaces
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Group sparse optimization via $\ell_{p,q}$ regularization
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
