Sensitivity analysis for nonlinear programming using penalty methods

DOI10.1007/BF01580677zbMATH Open0357.90064MaRDI QIDQ4133431FDOQ4133431

Authors: Anthony V. Fiacco 

Publication date: 1976

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity (robustness) (93B35) Sensitivity, stability, well-posedness (49K40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Validity of a Family of Optimization Methods
• On the continuity of the minimum set of a continuous function
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Title not available (Why is that?)
• Stability in Nonlinear Programming
• Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
• Solution for Turbulent Correlations Using Multipoint Distribution Functions
• The Univalence of an Integral
• Computational experience in sensitivity analysis for nonlinear programming
• Convergence properties of local solutions of sequences of mathematical programming problems in general spaces
• Nonlinear Programming: A Numerical Survey
• Implicit function theorems for mathematical programming and for systems of inequalities
• Title not available (Why is that?)

Cited In (88)

• Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
• Robust min-max portfolio strategies for rival forecast and risk scenarios
• A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
• Sensitivity analysis for non-linear programs with linear constraints
• Applications of the method of partial inverses to convex programming: Decomposition
• Estimates for Kuhn-Tucker points of perturbed convex programs
• A dimension-reduced method of sensitivity analysis for stochastic user equilibrium assignment model
• Lipschitz properties of solutions in mathematical programming
• Distribution sensitivity analysis for stochastic programs with complete recourse
• Sensitivity analysis for variational inequalities
• The advanced-step NMPC controller: Optimality, stability and robustness
• The explicit linear quadratic regulator for constrained systems
• Degeneracy in NLP and the development of results motivated by its presence
• A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
• On the sensitivity of the optimal partition for parametric second-order conic optimization
• Approximation of the steepest descent direction for the O-D matrix adjustment problem
• Stochastic and robust control of nonlinear economic systems
• A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems
• Necessary optimality conditions for Stackelberg problems
• Bilevel programming in traffic planning: Models, methods and challenge
• Analysis of the alternating direction method of multipliers for nonconvex problems
• The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming
• Coordination of pricing and inventory control across products
• Hölder continuity of solutions to elastic traffic network models
• Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis
• Second-order sensitivity analysis in factorable programming: Theory and applications
• Sensitivity and stability analysis for nonlinear programming
• Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty
• Optimization-simulation model for planning supply transport to large infrastructure public works located in congested urban areas
• Stability and sensitivity-analysis for stochastic programming
• Differentiability with respect to parameters of solutions to convex programming problems
• Sensitivity analysis in geometric programming
• Dynamic programming for constrained optimal control of discrete-time linear hybrid systems
• Time-axis decomposition of large-scale optimal control problems
• Derivative evaluation and computational experience with large bilevel mathematical programs
• On the differentiability of optimal values for bounded nonlinear programs with equality constraints
• Closed formulas in local sensitivity analysis for some classes of linear and non-linear problems
• Objective function bounds for the inexact linear programming problem with generalized cost coefficients
• Sensitivity analysis in economics
• Title not available (Why is that?)
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Implicitly defined optimization problems
• Parametric sensitivity analysis of perturbed PDE optimal control problems with state and control constraints
• Parametric global optimisation for bilevel programming
• A projected gradient and constraint linearization method for nonlinear model predictive control
• Sensitivity analysis in geometric programming: Theory and computations
• A parametric solution method for a generalized fractional programming problem
• Provably safe and robust learning-based model predictive control
• Differential sensitivity of solutions of convex constrained optimal control problems for discrete systems
• Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
• Generalized implicit function theorem and its application to parametric optimal control problems
• A globally convergent algorithm based on imbedding and parametric optimization
• Theoretical and algorithmic advances in multi-parametric programming and control
• Post-optimality sensitivity analysis in abstract spaces with applications to continuous-time programming problems
• Second Order Sufficiency Criteria for a Discrete Optimal Control Problem
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming
• Joint optimization for area traffic control and network flow
• Rates of convergence for adaptive Newton methods
• Solution differentiability for variational inequalities
• Algorithms for generalized fractional programming
• Global optimization of multi-parametric MILP problems
• Sensitivity analysis for discrete optimal control problems
• A multi-parametric programming approach for constrained dynamic programming problems
• Computational experience in sensitivity analysis for nonlinear programming
• Sensitivity analysis in posynomial geometric programming
• Convergence of algorithms for perturbed optimization problems
• Constrained approximation by splines with free knots
• Title not available (Why is that?)
• Solving nearly-separable quadratic optimization problems as nonsmooth equations
• On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
• Local properties of solutions of nonsmooth variational solutions of nonsmooth variational inequalities
• Exponential decay of sensitivity in graph-structured nonlinear programs
• The exact solution of multiparametric quadratically constrained quadratic programming problems
• Constructing large feasible suboptimal intervals for constrained nonlinear optimization
• Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers
• Sensitivity and parametric bound analysis for a single pass machining problem
• On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
• A new perspective on parameter study of optimization problems
• Sensitivity analysis of the value function for infinite dimensional optimal control problems and its relation to Riccati equations
• On Hölder continuity of solution maps to parametric vector primal and dual equilibrium problems
• Direct optimal control and model predictive control
• A novel approach for solving multi-parametric problems with nonlinear constraints
• Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems
• On the stability of solutions in honlinear programming
• Mini-workshop: Analysis of data-driven optimal control. Abstracts from the mini-workshop held May 9--15, 2021 (hybrid meeting)
• Mixed coordination method for non-linear programming problems with separable structures
• Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
• Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities.

This page was built for publication: Sensitivity analysis for nonlinear programming using penalty methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133431)