Proximal-like algorithm using the quasi D-function for convex second-order cone programming
type: Item
instance of: scholarly article
title: Proximal-like algorithm using the quasi D-function for convex second-order cone programming
zbMATH Open document ID: 1211.90237
published in: Journal of Optimization Theory and Applications
publication date: 2008-08-20T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5314350
zbMATH Keywords: Bregman functions
zbMATH Keywords: quasi D-functions
zbMATH Keywords: proximal-like methods
zbMATH Keywords: convex second-order cone programming
author: Shaohua Pan
author: Jein-Shan Chen
MaRDI profile type: Publication
full work available at URL: s10957-008-9380-8
OpenAlex ID: W2166443729
cites work: Proximal minimization algorithm with \(D\)-functions
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: Second-order cone programming
cites work: Interior point methods for second-order cone programming and OR applications
cites work: Applications of second-order cone programming
cites work: Analysis of nonsmooth vector-valued functions associated with second-order cones.
cites work: An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
cites work: Perturbation des méthodes d'optimisation. Applications
cites work: Proximité et dualité dans un espace hilbertien
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Multiplicative iterative algorithms for convex programming
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: Entropic Proximal Mappings with Applications to Nonlinear Programming
cites work: Q5580053
cites work: An iterative row-action method for interval convex programming
cites work: A relaxed version of Bregman's method for convex programming
cites work: Proximal Minimization Methods with Generalized Bregman Functions
cites work: Double-regularization proximal methods, with complementarity applications
cites work: Q4321748
cites work: Smoothing functions for second-order-cone complementarity problems
cites work: Some properties of generalized proximal point methods for quadratic and linear programming
cites work: Convex Analysis
DOI: 10.1007/S10957-008-9380-8
description: scientific article; zbMATH DE number 5314350