Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Critical sets in parametric optimization - MaRDI portal

Critical sets in parametric optimization

From MaRDI portal
Publication:3735499

DOI10.1007/BF01582234zbMath0599.90114MaRDI QIDQ3735499

Hubertus Th. Jongen, Frank Twilt, Peter Jonker

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)




Related Items

Relative eigenvalues of Hermitian matrices, Path-following energy optimization in unilateral contact problems, Generic Property of the Partial Calmness Condition for Bilevel Programming Problems, Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding, Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties, Bilevel optimization: on the structure of the feasible set, Global optimization of disjunctive programs, Typical profit singularities of one-parametric cyclic process with fixed period, Critical sets in one-parametric mathematical programs with complementarity constraints, Characterization of strong stability for C-stationary points in MPCC, Bifurcation problems in nonlinear parametric programming, On intrinsic complexity of Nash equilibrium problems and bilevel optimization, A noninterior path following algorithm for solving a class of multiobjective programming problems, Shape-stress trade-off design of membrane structures for specified sequence of boundary shapes, Generalized semi-infinite programming: a tutorial, The semismooth approach for semi-infinite programming under the reduction ansatz, Sequential quadratic programming methods for parametric nonlinear optimization, Solving semi-infinite programs by smoothing projected gradient method, Lifting mathematical programs with complementarity constraints, Smoothing by mollifiers. I: Semi-infinite optimization, Unnamed Item, A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization, \(p\)-regular nonlinearity: tangency at singularity in degenerate optimization problems, A note on weakly active constraints in connection with nonconvex quadratic programming, Optimal strategies and transitions between them in Arnold's model, Parametric approach to optimal control, Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder)., On generic quadratic penalty embeddings for nonlinear optimization problems, Proximal interior point method for convex semi-infinite programming, Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function, On parametric nonlinear programming, On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps, An algorithm constructing solutions for a family of linear semi-infinite problems., On the singularities in linear one-parametric optimization problems*, Embedding methods for solving variational inequalities, Bifurcations in parametric nonlinear programming, On the stratification of a class of specially structured matrices, A bifurcation analysis of the nonlinear parametric programming problem, One-parameter families of optimization problems: equality constraints, Unnamed Item, Path-following proximal approach for solving ill-posed convex semi-infinite programming problems, Vector optimization: Singularities, regularizations, A modified standard embedding with jumps in nonlinear optimization, Strong stability implies Mangasarian–Fromovitz Constraint Qualification, Unnamed Item, On level sets of marginal functions, Interactions Between Bilevel Optimization and Nash Games, An inertia theorem for symmetric matrices and its application to nonlinear programming, A smoothing Levenberg-Marquardt algorithm for semi-infinite programming, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints



Cites Work