A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
From MaRDI portal
Publication:5384603
DOI10.1080/02331934.2019.1576663zbMath1415.90090OpenAlexW2920252412MaRDI QIDQ5384603
Ming Huang, Jian Gu, Yi Zhang, Yue Lu
Publication date: 24 June 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1576663
Kurdyka-Łojasiewicz inequalityalternating direction method of multiplieriteration-complexitysparse inverse semidefinite quadratic programming problems
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Cites Work
- Unnamed Item
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- 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
- On semi- and subanalytic geometry
- Introductory lectures on convex optimization. A basic course.
- Some reverse location problems
- 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
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- On convergence of augmented Lagrangian method for inverse semi-definite quadratic programming problems
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Inverse Optimization
- Variational Analysis
- Combinatorial algorithms for inverse network flow problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
