Non-convex semi-infinite min-max optimization with noncompact sets
From MaRDI portal
Publication:2411166
DOI10.3934/jimo.2017022zbMath1373.90166OpenAlexW2560801696MaRDI QIDQ2411166
Meixia Li, Biao Qu, Chang-Yu Wang
Publication date: 20 October 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2017022
subdifferentialfirst-order optimality conditionssemi-infinite optimizationsubderivativesup-type function
Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of a smoothed penalty algorithm for semi-infinite programming
- Nonsmooth semi-infinite programming problem using limiting subdifferentials
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Feasible method for generalized semi-infinite programming
- Semi-infinite programming
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
- First order optimality conditions for generalized semi-infinite programming problems
- Air pollution control with semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- Optimization. Algorithms and consistent approximations
- Semismooth Newton methods for solving semi-infinite programming problems
- On optimality conditions for generalized semi-infinite programming problems
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- The stability of the maximum entropy method for nonsmooth semi-infinite programmings
- First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
- Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- The subdifferential and the directional derivatives of the maximum of a family of convex functions. II
- General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
- Semi-Infinite Programming: Theory, Methods, and Applications
- On duality theory of convex semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- The subdifferential and the directional derivatives of the maximum of a family of convex functions
- Variational Analysis
- Second order optimality conditions for generalized semi-infinite programming problems
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- Convex Analysis
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Semi-infinite programming. Recent advances
