Critical sets in parametric optimization
From MaRDI portal
The authors consider the nonlinear parametric programming problem. They introduce the concept of a generalized critical point for the nonlinear programming problem as well as for the nonlinear parametric programming problem. The set of generalized critical points for the parametric programming problem is divided into five types and each type is studied separately. In the end of the paper the set of Kuhn-Tucker points as a subset of the set of generalized critical points is considered in more detail.
Recommendations
Cites work
- Continuous deformation of nonlinear programs
- Differential topology
- scientific article; zbMATH DE number 3837771 (Why is no real title available?)
- scientific article; zbMATH DE number 3860299 (Why is no real title available?)
- scientific article; zbMATH DE number 3820767 (Why is no real title available?)
- scientific article; zbMATH DE number 3970698 (Why is no real title available?)
- scientific article; zbMATH DE number 3720698 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- Introduction to sensitivity and stability analysis in nonlinear programming
- On optimality conditions for structured families of nonlinear programming problems
- One-parameter families of optimization problems: equality constraints
Cited in
(55)- An inertia theorem for symmetric matrices and its application to nonlinear programming
- Relative eigenvalues of Hermitian matrices
- A note on weakly active constraints in connection with nonconvex quadratic programming
- Vector optimization: Singularities, regularizations
- Global optimization of disjunctive programs
- A noninterior path following algorithm for solving a class of multiobjective programming problems
- Path-following energy optimization in unilateral contact problems
- Bilevel optimization: on the structure of the feasible set
- Shape-stress trade-off design of membrane structures for specified sequence of boundary shapes
- On parametric 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
- Characterization of strong stability for C-stationary points in MPCC
- On intrinsic complexity of Nash equilibrium problems and bilevel optimization
- Optimal strategies and transitions between them in Arnold's model
- Path-following proximal approach for solving ill-posed convex semi-infinite programming problems
- A modified standard embedding with jumps in nonlinear optimization
- 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
- Embedding methods for solving variational inequalities
- On the singularities in linear one-parametric optimization problems*
- On the stratification of a class of specially structured matrices
- Strong stability implies Mangasarian–Fromovitz Constraint Qualification
- scientific article; zbMATH DE number 4149011 (Why is no real title available?)
- scientific article; zbMATH DE number 4152171 (Why is no real title available?)
- Typical profit singularities of one-parametric cyclic process with fixed period
- Critical sets in one-parametric mathematical programs with complementarity constraints
- Bifurcation problems in nonlinear parametric programming
- scientific article; zbMATH DE number 597936 (Why is no real title available?)
- The Crease Structure of the Karush-Kuhn-Tucker Set in Parametric Optimization
- On level sets of marginal functions
- Sequential quadratic programming methods for parametric nonlinear optimization
- Solving semi-infinite programs by smoothing projected gradient method
- Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding
- Interactions between bilevel optimization and Nash games
- Generic property of the partial calmness condition for bilevel programming problems
- scientific article; zbMATH DE number 7413562 (Why is no real title available?)
- A Lagrange multiplier expression method for bilevel polynomial optimization
- scientific article; zbMATH DE number 6176036 (Why is no real title available?)
- Standard embedding for linear complementarity problems
- 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.
- Topological aspects of nonsmooth optimization.
- Lifting mathematical programs with complementarity constraints
- p-regular nonlinearity: tangency at singularity in degenerate optimization problems
- Parametric approach to optimal control
- Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder).
- Bifurcations in parametric nonlinear programming
- A bifurcation analysis of the nonlinear parametric programming problem
- One-parameter families of optimization problems: equality constraints
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- Generalized semi-infinite programming: a tutorial
- The semismooth approach for semi-infinite programming under the reduction ansatz
- Smoothing by mollifiers. I: Semi-infinite optimization
This page was built for publication: Critical sets in parametric optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735499)