Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
From MaRDI portal
Publication:1987439
DOI10.1016/j.cam.2020.112838OpenAlexW3013670805MaRDI QIDQ1987439
Lidan Li, Li-wei Zhang, Hong-Wei Zhang
Publication date: 15 April 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2020.112838
Related Items
Discrete gradient-zeroing neural network algorithms for handling future quadratic program as well as robot arm via ten-instant formula, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- On an instance of the inverse shortest paths problem
- A further study on inverse linear programming problems
- Solution structure of some inverse combinatorial optimization problems
- Weight reduction problems with certain bottleneck objectives.
- Inverse conic programming with applications
- The complexity analysis of the inverse center location problem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Calculating some inverse linear programming problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Inverse analysis of Navier–Stokes equations using simplex search method
- Inverse Optimization
- Optimization and nonsmooth analysis
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Semismooth and Semiconvex Functions in Constrained Optimization
- Variational Analysis
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Combinatorial algorithms for inverse network flow problems
- A simulated annealing-based inverse computational fluid dynamics model for unknown parameter estimation in fluid flow problem
- A perturbation approach for a type of inverse linear programming problems
- Semismooth Matrix-Valued Functions
