A perturbation approach for an inverse quadratic programming problem
type: Item
instance of: scholarly article
title: A perturbation approach for an inverse quadratic programming problem
zbMATH Open document ID: 1202.49046
author: Xiantao Xiao
author: Jianzhong Zhang
author: Liwei Zhang
published in: Mathematical Methods of Operations Research
publication date: 2010-12-03T00:00:00Z
Mathematics Subject Classification ID: 49N45
Mathematics Subject Classification ID: 49N10
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 5822842
zbMATH Keywords: inverse optimization
zbMATH Keywords: quadratic programming
zbMATH Keywords: perturbation approach
zbMATH Keywords: inexact Newton method
MaRDI profile type: Publication
full work available at URL: s00186-010-0323-4
OpenAlex ID: W1999131235
cites work: Inverse Optimization
cites work: Combinatorial algorithms for inverse network flow problems
cites work: Q4503250
cites work: On an instance of the inverse shortest paths problem
cites work: The complexity analysis of the inverse center location problem
cites work: Optimization and nonsmooth analysis
cites work: Minimization of \(SC^ 1\) functions and the Maratos effect
cites work: Q4524230
cites work: A smoothing method for mathematical programs with equilibrium constraints
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Computing a nearest symmetric positive semidefinite matrix
cites work: Q3141900
cites work: Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
cites work: Inverse conic programming with applications
cites work: Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
cites work: A modified relaxation scheme for mathematical programs with complementarity constraints
cites work: Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
cites work: A nonsmooth version of Newton's method
cites work: Q4050397
cites work: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
cites work: A further result on an implicit function theorem for locally Lipschitz functions
cites work: The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
cites work: Semismooth Matrix-Valued Functions
cites work: The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
cites work: Merit functions for semi-definite complementarity problems
cites work: Calculating some inverse linear programming problems
cites work: A further study on inverse linear programming problems
cites work: Some reverse location problems
cites work: Solution structure of some inverse combinatorial optimization problems
cites work: An augmented Lagrangian method for a class of Inverse quadratic programming problems
DOI: 10.1007/S00186-010-0323-4
description: scientific article; zbMATH DE number 5822842