Solving a class of inverse semidefinite quadratic programming problem
From MaRDI portal
Recommendations
- A sequential convex program approach to an inverse linear semidefinite programming problem
- A perturbation approach for an inverse quadratic programming problem
- Solving a class of inverse QP problems by a smoothing Newton method
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems
Cites work
- A Faster Algorithm for the Inverse Spanning Tree Problem
- A further study on inverse linear programming problems
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A majorized penalty approach to inverse linear second order cone programming problems
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- A perturbation approach for a type of inverse linear programming problems
- A perturbation approach for an inverse quadratic programming problem
- A potential reduction algorithm for an extended SDP problem
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
- A sequential convex program approach to an inverse linear semidefinite programming problem
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- An alternating direction numerical method for a class of inverse quadratic programming problems
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- An efficient algorithm for convex quadratic semi-definite optimization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Calculating some inverse linear programming problems
- Convexity of symmetric cone trace functions in Euclidean Jordan algebras
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- scientific article; zbMATH DE number 1552023 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse conic programming with applications
- Inverse quadratic programming problem with \(l_1\) norm measure
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- Linear and nonlinear programming.
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Optimization and nonsmooth analysis
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Semismooth Matrix-Valued Functions
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- The inverse newsvendor problem: choosing an optimal demand portfolio for capacitated resources
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Variational Analysis
- Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone
This page was built for publication: Solving a class of inverse semidefinite quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188349)
