On parametric nonlinear programming

DOI10.1007/BF02055198zbMath0723.90074OpenAlexW1989445941MaRDI QIDQ2276886

Hubertus Th. Jongen, Gerhard-Wilhelm Weber

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02055198

zbMATH Keywords

surveyparametric optimizationcritical pointstransversalityperturbation analysisinequality constraintsstationary pointsMorse lemmaImplicit Function Theoremmarginal value functionsingularity theory of smooth mappings

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (18)

On generalized semi-infinite optimization of genetic networks ⋮ Theoretical and algorithmic advances in multi-parametric programming and control ⋮ Mathematical contributions to dynamics and optimization of gene-environment networks ⋮ A survey on OR and mathematical methods applied on gene-environment networks ⋮ Mathematical encouragement of companies to cooperate by using cooperative games with fuzzy approach ⋮ A noninterior path following algorithm for solving a class of multiobjective programming problems ⋮ Sequential quadratic programming methods for parametric nonlinear optimization ⋮ Inverse solution for parameter estimation of a dynamic volume spline based forehead skin model ⋮ An algorithm to analyze stability of gene-expression patterns ⋮ Optimization of gene-environment networks in the presence of errors and uncertainty with Chebychev approximation ⋮ Generalized desirability functions: a structural and topological analysis of desirability functions ⋮ Simultaneous small noise limit for singularly perturbed slow-fast coupled diffusions ⋮ An algorithmic approach to analyse genetic networks and biological energy production: an introduction and contribution where OR meets biology† ⋮ Bifurcations in parametric nonlinear programming ⋮ Monitoring and prioritising alerts for exception analytics ⋮ On optimization, dynamics and uncertainty: A tutorial for gene-environment networks ⋮ A two-warehouse probabilistic model with price discount on backorders under two levels of trade-credit policy ⋮ Estimation of the Hurst parameter for fractional Brownian motion using the CMARS method

Cites Work

• Implicit functions and sensitivity of stationary points
• One-parameter families of optimization problems: equality constraints
• Duality for non-convex variational principles
• Introduction to sensitivity and stability analysis in nonlinear programming
• Definiteness and semidefiniteness of quadratic forms revisited
• The continuous, desingularized Newton method for meromorphic functions
• Global bounds for the Betti numbers of regular fibers of differentiable mappings
• An inertia theorem for symmetric matrices and its application to nonlinear programming
• Singularities and groups in bifurcation theory. Volume I
• New results on a class of exact augmented Lagrangians
• Optimization with nonsmooth data
• On inertia and Schur complement in optimization
• Morse theory for some lower-\(C^ 2\) functions in finite dimension
• Computable bounds on parametric solutions of convex problems
• Convex two-level optimization
• Rudiments of an average case complexity theory for piecewise-linear path following algorithms
• An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems
• Second-order necessary conditions in semismooth optimization
• Approximation and decomposition properties of some classes of locally d.c. functions
• Schur complements and statistics
• Generalized gradients of Lipschitz functionals
• Optimal solutions to differential inclusions
• Existence theorems for general control problems of Bolza and Lagrange
• On the inverse function theorem
• Singularity theory and an introduction to catastrophe theory
• Singularities of the maximum of a parametrically dependent function
• Topological stability of smooth mappings
• Generalized cohomological index theories for Lie group actions with an application to bifurcation questions for Hamiltonian systems
• The upper and lower second order directional derivatives of a sup-type function
• Manifestations of the Schur complement
• Methods of descent for nondifferentiable optimization
• Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
• Sur le cut-locus d'une variété plongee
• On Iterated Minimization in Nonconvex Optimization
• On Functions Representable as a Supremum of a Family of Smooth Functions
• Equivalence of Surface Density and Average Directional Density
• On quasidifferentiable mappings
• An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold
• Continuous deformation of nonlinear programs
• Solution point differentiability without strict complementarity in nonlinear programming
• Optimization and nonsmooth analysis
• Structure of the first-order solution set for a class of nonlinear programs with parameters
• ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
• The Set of Zeroes of an "Almost Polynomial" Function
• On the continuity of a Lagrangian multiplier function in input optimization
• Critical sets in parametric optimization
• On Functions Representable As a Supremum of a Family of Smooth Functions II
• A generalization of the Tarski-Seidenberg theorem, and some nondefinability results
• On stability and stationary points in nonlinear optimization
• Structural stability in nonlinear optimization
• Bifurcation problems in nonlinear parametric programming
• Generalized convexity and concavity of the optimal value function in nonlinear programming
• On linearization and continuous selections of functions
• Exact Penalties for Local Minima
• Lipschitz Continuity for Constrained Processes
• Accelerated convergence for the Powell/Hestenes multiplier method
• Exploiting structure in piecewise-linear homotopy algorithms for solving equations
• Strongly Regular Generalized Equations
• Locating an Isolated Global Minimizer of a Constrained Nonconvex Program
• Bounding Global Minima
• On the number of solutions to a class of complementarity problems
• Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings
• On optimality conditions for structured families of nonlinear programming problems
• Estimation in Covariance Components Models
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• Implicit function theorems for mathematical programming and for systems of inequalities
• Generalized Gradients and Applications
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• On triangulations for computing fixed points
• Estimates of the Duality Gap in Nonconvex Optimization
• Maximum Likelihood Approaches to Variance Component Estimation and to Related Problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• Gradients Généralisés de Fonctions Marginales
• An Algorithm for Constrained Optimization with Semismooth Functions
• On the homotopic approach to systems of equations with separable mappings
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Generalized equations and their solutions, Part I: Basic theory
• A New Approach to Lagrange Multipliers
• Introduction to Numerical Continuation Methods
• Solving generalized equations via homotopies
• On sufficient conditions for local optimality in semi-infinite programming
• An Algorithm for Piecewise Linear Approximation of Implicitly Defined Two-Dimensional Surfaces
• Level Sets and Continuity of Conjugate Convex Functions
• MINKOWSKI DUALITY AND ITS APPLICATIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On parametric nonlinear programming