Non-convex semi-infinite min-max optimization with noncompact sets
From MaRDI portal
Publication:2411166
Recommendations
- First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
Cites work
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A new smoothing Newton-type algorithm for semi-infinite programming
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- Air pollution control with semi-infinite programming
- 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
- Convex Analysis
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Feasible method for generalized semi-infinite programming
- First order optimality conditions for generalized semi-infinite programming problems
- First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- First-order optimality conditions in generalized semi-infinite programming
- General semi-infinite programming: symmetric Mangasarian-Fromovitz constraint qualification and the closure of the feasible set
- Generalized semi-infinite optimization: A first order optimality condition and examples
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 5493307 (Why is no real title available?)
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Nonsmooth semi-infinite programming problem using limiting subdifferentials
- On duality theory of convex semi-infinite programming
- On optimality conditions for generalized semi-infinite programming problems
- On the convergence of a smoothed penalty algorithm for semi-infinite programming
- Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
- Optimization. Algorithms and consistent approximations
- Second order optimality conditions for generalized semi-infinite programming problems
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming. Recent advances
- Semismooth Newton methods for solving semi-infinite programming problems
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- The stability of the maximum entropy method for nonsmooth semi-infinite programmings
- The subdifferential and the directional derivatives of the maximum of a family of convex functions
- The subdifferential and the directional derivatives of the maximum of a family of convex functions. II
- Variational Analysis
Cited in
(4)- First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets
- Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
This page was built for publication: Non-convex semi-infinite min-max optimization with noncompact sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411166)
