The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
type: Item
instance of: scholarly article
title: The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
zbMATH Open document ID: 1298.90005
author: Yi Zhang
author: Yue Wu
author: Liwei Zhang
published in: Top
publication date: 2014-10-08T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 6352453
zbMATH Keywords: inverse optimization
zbMATH Keywords: second-order cone quadratic programming
zbMATH Keywords: augmented Lagrangian method
zbMATH Keywords: rate of convergence
zbMATH Keywords: damped semismooth Newton method
describes a project that uses: SeDuMi
MaRDI profile type: Publication
full work available at URL: s11750-011-0227-3
OpenAlex ID: W2037889019
cites work: Inverse Optimization
cites work: Combinatorial algorithms for inverse network flow problems
cites work: Second-order cone programming
cites work: Combined Primal-Dual and Penalty Methods for Constrained Minimization
cites work: On the method of multipliers for convex programming
cites work: On Penalty and Multiplier Methods for Constrained Minimization
cites work: On an instance of the inverse shortest paths problem
cites work: The complexity analysis of the inverse center location problem
cites work: Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
cites work: Optimization and nonsmooth analysis
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Multiplier and gradient methods
cites work: Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
cites work: Inverse conic programming with applications
cites work: Applications of second-order cone programming
cites work: Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
cites work: An augmented Lagrangian interior-point method using directions of negative curvature
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Improving directions of negative curvature in an efficient manner
cites work: Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
cites work: A nonsmooth version of Newton's method
cites work: A dual approach to solving nonlinear programming problems by unconstrained optimization
cites work: The multiplier method of Hestenes and Powell applied to convex programming
cites work: Q4050397
cites work: On concepts of directional differentiability
cites work: Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
cites work: The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
cites work: A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
cites work: Calculating some inverse linear programming problems
cites work: A further study on inverse linear programming problems
cites work: Some reverse location problems
cites work: Solution structure of some inverse combinatorial optimization problems
cites work: An augmented Lagrangian method for a class of Inverse quadratic programming problems
DOI: 10.1007/S11750-011-0227-3
description: scientific article; zbMATH DE number 6352453