Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
type: Item
instance of: scholarly article
title: Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
author: Lidan Li
author: Liwei Zhang
author: Hongwei Zhang
published in: Journal of Computational and Applied Mathematics
publication date: 2020-04-15T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7189433
zbMATH Keywords: \(l_1\) vector norm
zbMATH Keywords: inverse optimization
zbMATH Keywords: semidefinite quadratic programming
zbMATH Keywords: smoothing Newton method
describes a project that uses: CGS
MaRDI profile type: Publication
full work available at URL: j.cam.2020.112838
OpenAlex ID: W3013670805
cites work: Inverse analysis of Navier–Stokes equations using simplex search method
cites work: A simulated annealing-based inverse computational fluid dynamics model for unknown parameter estimation in fluid flow problem
cites work: On an instance of the inverse shortest paths problem
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Inverse Optimization
cites work: Combinatorial algorithms for inverse network flow problems
cites work: The complexity analysis of the inverse center location problem
cites work: Solution structure of some inverse combinatorial optimization problems
cites work: Weight reduction problems with certain bottleneck objectives.
cites work: Calculating some inverse linear programming problems
cites work: A further study on inverse linear programming problems
cites work: A perturbation approach for a type of inverse linear programming problems
cites work: Inverse conic programming with applications
cites work: An augmented Lagrangian method for a class of Inverse quadratic programming problems
cites work: On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems
cites work: A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
cites work: A sequential convex program approach to an inverse linear semidefinite programming problem
cites work: Optimization and nonsmooth analysis
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: A nonsmooth version of Newton's method
cites work: Q4767830
cites work: Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
cites work: Q4503250
cites work: Semismooth Matrix-Valued Functions
cites work: The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
cites work: A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Variational Analysis
cites work: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
cites work: Q3816922
cites work: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
DOI: 10.1016/J.CAM.2020.112838
description: scientific article; zbMATH DE number 7189433