Newton-type Methods with Generalized Distances For Constrained Optimization
type: Item
instance of: scholarly article
title: Newton-type Methods with Generalized Distances For Constrained Optimization
zbMATH Open document ID: 0905.49015
DOI: 10.1080/02331939708844339
published in: Optimization
publication date: 1999-01-18T00:00:00Z
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49K40
zbMATH DE Number: 1078815
zbMATH Keywords: electrical networks
zbMATH Keywords: nonlinear optimization
zbMATH Keywords: interior point algorithms
zbMATH Keywords: proximal point methods
zbMATH Keywords: unconstrained Newton-type methods
author: Alfredo Iusem
author: M. V. Solodov
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331939708844339
OpenAlex ID: W2048992473
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Proximal minimization algorithm with \(D\)-functions
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: A relaxed version of Bregman's method for convex programming
cites work: Q3702408
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: Multiplicative iterative algorithms for convex programming
cites work: Solution of linear complementarity problems using minimization with simple bounds
cites work: Some properties of generalized proximal point methods for quadratic and linear programming
cites work: Q3491338
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Modified Projection-Type Methods for Monotone Variational Inequalities
description: scientific article; zbMATH DE number 1078815