Second-order sensitivity analysis in factorable programming: Theory and applications
From MaRDI portal
Publication:1104867
Recommendations
- scientific article; zbMATH DE number 3916041
- Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
- Sensitivity analysis of optimization problems under second order regular constraints
- Toward second-order sensitivity analysis in set-valued optimization
- Second-order sensitivity analysis for parametric equilibrium problems in set-valued optimization
- First and second order sensitivity analysis of nonlinear programs under directional constraint qualification conditions
- scientific article; zbMATH DE number 6828746
- Sensitivity Analysis of Parametrized Programs via Generalized Equations
- scientific article; zbMATH DE number 3904111
- Sensitivity analysis in bilevel linear programming
Cites work
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 3662892 (Why is no real title available?)
- scientific article; zbMATH DE number 3689175 (Why is no real title available?)
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 3628660 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3103269 (Why is no real title available?)
- An Algorithm for Separable Nonconvex Programming Problems
- An Indirect Sufficiency Proof for the Problem of Lagrange with Differential Inequalities as Added Side Conditions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational experience in sensitivity analysis for nonlinear programming
- Higher-order necessary conditions for infinite and semi-infinite optimization
- Introduction to sensitivity and stability analysis in nonlinear programming
- Second Order Conditions for Constrained Minima
- Sensitivity analysis for nonlinear programming using penalty methods
- Sensitivity analysis in geometric programming
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques
Cited in
(5)- Second-order adjoint sensitivity analysis methodology (2nd-ASAM) for computing exactly and efficiently first- and second-order sensitivities in large-scale linear systems. I: Computational methodology
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- On bilevel programming. I: General nonlinear cases
- Sensitivity analysis of optimization problems under second order regular constraints
- Optimization with unary functions
This page was built for publication: Second-order sensitivity analysis in factorable programming: Theory and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104867)