A perturbation approach for an inverse quadratic programming problem
DOI10.1007/S00186-010-0323-4zbMATH Open1202.49046OpenAlexW1999131235MaRDI QIDQ607673FDOQ607673
Xiantao Xiao, Jianzhong Zhang, Liwei Zhang
Publication date: 3 December 2010
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-010-0323-4
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Newton-type methods (49M15) Linear-quadratic optimal control problems (49N10) Inverse problems in optimal control (49N45) Duality theory (optimization) (49N15)
Cites Work
- A nonsmooth version of Newton's method
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Semismooth and Semiconvex Functions in Constrained Optimization
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Computing a nearest symmetric positive semidefinite matrix
- A smoothing method for mathematical programs with equilibrium constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Title not available (Why is that?)
- The complexity analysis of the inverse center location problem
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Merit functions for semi-definite complementarity problems
- Inverse Optimization
- Combinatorial algorithms for inverse network flow problems
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- On an instance of the inverse shortest paths problem
- Calculating some inverse linear programming problems
- Semismooth Matrix-Valued Functions
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- A further study on inverse linear programming problems
- Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
- A further result on an implicit function theorem for locally Lipschitz functions
- Inverse conic programming with applications
- Solution structure of some inverse combinatorial optimization problems
- Some reverse location problems
- Title not available (Why is that?)
- Minimization of \(SC^ 1\) functions and the Maratos effect
Cited In (5)
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- Title not available (Why is that?)
- A majorized penalty approach to inverse linear second order cone programming problems
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- A perturbation approach for an inverse quadratic programming problem over second-order cones
Recommendations
- A perturbation approach for an inverse quadratic programming problem over second-order cones 👍 👎
- A Newton method for inverse problems of quadratic programming 👍 👎
- Inverse quadratic programming problem with \(l_1\) norm measure 👍 👎
- Solving a class of inverse QP problems by a smoothing Newton method 👍 👎
- A perturbation approach for a type of inverse linear programming problems 👍 👎
This page was built for publication: A perturbation approach for an inverse quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607673)
