Self-adaptive inexact proximal point methods

DOI10.1007/s10589-007-9067-3zbMath1147.90414OpenAlexW2108059738MaRDI QIDQ2479838

Hongchao Zhang, William W. Hager

Publication date: 3 April 2008

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9067-3

zbMATH Keywords

Degenerate optimizationMultiple minimaProximal pointSelf-adaptive method

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55)

Related Items

Iterative Methods for the Elastography Inverse Problem of Locating Tumors, Descentwise inexact proximal algorithms for smooth optimization, Interior proximal methods for quasiconvex optimization, On the local convergence of a derivative-free algorithm for least-squares minimization, An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints, Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem, An inexact proximal regularization method for unconstrained optimization, An inexact and nonmonotone proximal method for smooth unconstrained minimization, A Lyusternik-Graves theorem for the proximal point method, An improved proximal alternating direction method for monotone variational inequalities with separable structure, A regularized Newton method for monotone nonlinear equations and its application, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC, A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization, Inexact proximal point methods in metric spaces, Proximal Methods for the Elastography Inverse Problem of Tumor Identification Using an Equation Error Approach, The indefinite proximal point algorithms for maximal monotone operators, Algebraic rules for quadratic regularization of Newton's method

Uses Software

• CUTEr
• CG_DESCENT
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximal point methods and nonconvex optimization
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• Regularized Newton methods for convex minimization problems with singular solutions
• Inexact proximal point algorithms and descent methods in optimization
• The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• A Generalization of the Proximal Point Algorithm
• Algorithm 851
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• CUTE
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Proximal Methods for Cohypomonotone Operators
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity