An augmented Lagrangian method for a class of Inverse quadratic programming problems
From MaRDI portal
(Redirected from Publication:989969)
Recommendations
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems
- Augmented Lagrangian applied to convex quadratic problems
- A perturbation approach for an inverse quadratic programming problem
- A Newton method for inverse problems of quadratic programming
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 895182 (Why is no real title available?)
- A Dual Approach to Semidefinite Least-Squares Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A further study on inverse linear programming problems
- A nonsmooth version of Newton's method
- Calculating some inverse linear programming problems
- Combinatorial algorithms for inverse network flow problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Inverse Optimization
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse conic programming with applications
- Minimization of \(SC^ 1\) functions and the Maratos effect
- On an instance of the inverse shortest paths problem
- On concepts of directional differentiability
- Optimization and nonsmooth analysis
- Semismooth Matrix-Valued Functions
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solution structure of some inverse combinatorial optimization problems
- The complexity analysis of the inverse center location problem
- The inverse newsvendor problem: choosing an optimal demand portfolio for capacitated resources
- The multiplier method of Hestenes and Powell applied to convex programming
- The practice of portfolio replication. A practical overview of forward and inverse problems
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Weight reduction problems with certain bottleneck objectives.
Cited in
(24)- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- An alternating direction numerical method for a class of inverse quadratic programming problems
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Exact augmented Lagrangian duality for mixed integer quadratic programming
- scientific article; zbMATH DE number 7590223 (Why is no real title available?)
- Inverse quadratic programming problem with \(l_1\) norm measure
- On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems
- A type of non-differentiable inverse quadratic programming problems
- On the duality of quadratic minimization problems using pseudo inverses
- scientific article; zbMATH DE number 6610411 (Why is no real title available?)
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- A Newton method for inverse problems of quadratic programming
- On linear programs with linear complementarity constraints
- A majorized penalty approach to inverse linear second order cone programming problems
- The augmented Lagrangian method based on the APG strategy for an inverse damped gyroscopic eigenvalue problem
- Solving a class of inverse semidefinite quadratic programming problem
- A perturbation approach for a type of inverse linear programming problems
- A perturbation approach for an inverse quadratic programming problem
- Semi-monotonic inexact augmented Lagrangians for quadratic programing with equality constraints
- A perturbation approach for an inverse quadratic programming problem over second-order cones
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Recursive quadratic programming methods based on the augmented lagrangian
- A penalty-type method for solving inverse optimal value problem in second-order conic programming
This page was built for publication: An augmented Lagrangian method for a class of Inverse quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989969)
