Directional derivative of the marginal function in nonlinear programming
From MaRDI portal
Recommendations
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Directional derivative of marginal function in mathematical programming
- On The Marginal Function in Nonlinear Programming
- scientific article; zbMATH DE number 4060198
- scientific article; zbMATH DE number 16311
Cited in
(only showing first 100 items - show all)- A quadratically approximate framework for constrained optimization, global and local convergence
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
- Constant-rank condition and second-order constraint qualification
- On Lipschitz-like continuity of a class of set-valued mappings
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
- Erratum to: ``New constraint qualifications and optimality conditions for second order cone programs
- A necessary and a sufficient optimality condition for bilevel programming problems
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Convergence results of an augmented Lagrangian method using the exponential penalty function
- On The Marginal Function in Nonlinear Programming
- A practical second-order optimality condition for cardinality-constrained problems with application to an augmented Lagrangian method
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
- Relation between the constant rank and the relaxed constant rank constraint qualifications
- Directional subdifferential of the value function
- Tangency and differentiation: Marginal functions
- Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems
- An application of matrix computations to classical second-order optimality conditions
- A relaxed constant positive linear dependence constraint qualification and applications
- A reduced Hessian SQP method for inequality constrained optimization
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
- A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model
- A re-examination of constrained Pareto inefficiency in economies with incomplete markets
- Maximum likelihood estimation of symmetric group-based models via numerical algebraic geometry
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization
- Directional differentiability of optimal solutions under Slater's condition
- Second order multipliers and marginal function in non linear programs
- A Newton-type method for quasi-equilibrium problems and applications
- On tangent cone to systems of inequalities and equations in Banach spaces under relaxed constant rank condition
- Robinson Stability of Parametric Constraint Systems via Variational Analysis
- Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem
- Exact penalty functions for convex bilevel programming problems.
- Note on Mangasarian-Fromovitz-like constraint qualifications
- On Lipschitz continuity of projections onto polyhedral moving sets
- Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- A new constraint qualification condition
- On a smooth dual gap function for a class of quasi-variational inequalities
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- Directional derivatives of optimal value functions in mathematical programming
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- On M-stationarity conditions in MPECs and the associated qualification conditions
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
- A proximal Newton-type method for equilibrium problems
- Generalized sensitivity analysis of nonlinear programs
- A globally convergent regularized interior point method for constrained optimization
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- On the best achievable quality of limit points of augmented Lagrangian schemes
- A practicable way for computing the directional derivative of the optimal value function in convex programming
- Farkas' theorem of nonconvex type and its application to a min-max problem
- Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications
- Directional differentiation of marginal functions in mathematical programming problems
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
- On the sensitivity of a Euclidean projection
- The generalized jacobian of the optimal solution in parametric optimization
- On a smooth dual gap function for a class of player convex generalized Nash equilibrium problems
- New constraint qualifications and optimality conditions for second order cone programs
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Implications of the constant rank constraint qualification
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- Sufficient optimality conditions in bilevel programming
- On relaxing the Mangasarian-Fromovitz constraint qualification
- scientific article; zbMATH DE number 10783 (Why is no real title available?)
- A constant rank constraint qualification in continuous-time nonlinear programming
- A minimal face constant rank constraint qualification for reducible conic programming
- Relaxation approaches for nonlinear sparse optimization problems
- Global convergence of an augmented Lagrangian method for nonlinear programming via Riemannian optimization
- A new constant-rank-type condition related to MFCQ and local error bounds
- Higher-order optimality conditions for nonregular multiobjective problem
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
- Second-order enhanced optimality conditions and constraint qualifications
- Quasidifferntiability of optimal solutions in parametric optimal solutions in parametric nonlinear optimization
- Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
- Optimality conditions and exact penalty for mathematical programs with switching constraints
- Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
- A smoothing Newton method for semi-infinite programming
- On error bounds and Newton-type methods for generalized Nash equilibrium problems
- Approximate first-order and second-order directional derivatives of a marginal function in convex optimization
- Towards an efficient augmented Lagrangian method for convex quadratic programming
- Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems
- On relaxed constant rank regularity condition in mathematical programming
- Directional necessary optimality conditions for bilevel programs
- Solving quadratic multi-leader-follower games by smoothing the follower's best response
- Error estimation in nonlinear optimization
- Directional derivative of the value function for parametric set-constrained optimization problems
- Value functions and their directional derivatives in parametric nonlinear programming
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- A globalized Newton method for the computation of normalized Nash equilibria
- ADMM for multiaffine constrained optimization
- On Local Error Bound in Nonlinear Programs
- On error bounds for quasinormal programs
- Directional Lipschitzian optimal solution of infinite-dimensional optimization problems
- Constraint qualification with Schauder basis for infinite programming problems
- On second-order optimality conditions for vector optimization
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- The computation of approximate feedback Stackelberg equilibria in multiplayer nonlinear constrained dynamic games
- Rank theorem in infinite dimension and Lagrange multipliers
This page was built for publication: Directional derivative of the marginal function in nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342225)
