Feasible method for generalized semi-infinite programming
From MaRDI portal
Publication:604267
Recommendations
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Feasible method for semi-infinite programs
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Generalized semi-infinite programming: a tutorial
- Generalized semi-infinite programming: numerical aspects
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 4035566 (Why is no real title available?)
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- A modified relaxation scheme for mathematical programs with complementarity constraints
- A note on error estimates for some interior penalty methods
- A semi-infinite approach to design centering
- A smoothing method for mathematical programs with equilibrium constraints
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bi-level strategies in semi-infinite programming.
- Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
- Engineering and Economic Applications of Complementarity Problems
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- Generalized semi-infinite programming: a tutorial
- Global solution of semi-infinite programs
- Lifting mathematical programs with complementarity constraints
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Nonlinear optimization: Characterization of structural stability
- On Karush-Kuhn-Tucker points for a smoothing method in semi-infinite optimizations
- On NCP-functions
- On generalized semi-infinite optimization and bilevel optimization
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Smoothing methods for convex inequalities and linear complementarity problems
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
Cited in
(15)- How to solve a semi-infinite optimization problem
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- MPEC methods for bilevel optimization problems
- How to solve a design centering problem
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Lower level duality and the global solution of generalized semi-infinite programs
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Interior point filter method for semi-infinite programming problems
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- Non-convex semi-infinite min-max optimization with noncompact sets
- Feasible method for semi-infinite programs
This page was built for publication: Feasible method for generalized semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604267)
