Feasible method for generalized semi-infinite programming
type: Item
instance of: scholarly article
title: Feasible method for generalized semi-infinite programming
zbMATH Open document ID: 1202.90256
published in: Journal of Optimization Theory and Applications
publication date: 2010-11-10T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5814308
zbMATH Keywords: mathematical program with equilibrium constraints
zbMATH Keywords: bilevel programming
zbMATH Keywords: design centering
author: Oliver Stein
author: Anton Winterfeld
describes a project that uses: alphaBB
MaRDI profile type: Publication
full work available at URL: s10957-010-9674-5
OpenAlex ID: W2034728596
cites work: Solving Semi-Infinite Optimization Problems with Interior Point Techniques
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: Bi-level strategies in semi-infinite programming.
cites work: Generalized semi-infinite programming: a tutorial
cites work: A semi-infinite approach to design centering
cites work: Q4889854
cites work: Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
cites work: Global solution of semi-infinite programs
cites work: On generalized semi-infinite optimization and bilevel optimization
cites work: Q4332850
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
cites work: Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
cites work: Nonlinear optimization: Characterization of structural stability
cites work: Smoothing methods for convex inequalities and linear complementarity problems
cites work: A smoothing method for mathematical programs with equilibrium constraints
cites work: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
cites work: A modified relaxation scheme for mathematical programs with complementarity constraints
cites work: Lower-order penalty methods for mathematical programs with complementarity constraints
cites work: Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
cites work: Lifting mathematical programs with complementarity constraints
cites work: On NCP-functions
cites work: Q5440595
cites work: A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
cites work: Q3134873
cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems
cites work: Q5395213
cites work: Q3775324
DOI: 10.1007/S10957-010-9674-5
description: scientific article; zbMATH DE number 5814308