Inexact variable metric method for convex-constrained optimization problems

DOI10.1080/02331934.2021.1887181zbMath1486.90186OpenAlexW3130203750MaRDI QIDQ5034933

Tiago C. Menezes, Douglas S. Gonçalves, Max L. N. Gonçalves

Publication date: 21 February 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2021.1887181

zbMATH Keywords

approximate solutionspectral gradient methodprojected gradient methodconvex-constrained optimization probleminexact variable metric method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A Newton Frank-Wolfe method for constrained self-concordant minimization ⋮ On the inexact scaled gradient projection method

Uses Software

• SPG
• CUTEr
• MINQ
• MINQ8

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of nonmonotone spectral projected gradient methods
• Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
• On the use of the spectral projected gradient method for support vector machines
• An inexact primal-dual path following algorithm for convex quadratic SDP
• Computing a nearest symmetric positive semidefinite matrix
• MINQ8: general definite and bound constrained indefinite quadratic programming
• Least-squares solution of \(F=PG\) over positive semidefinite symmetric \(P\)
• Two spectral gradient projection methods for constrained equations and their linear convergence rate
• Spectral gradient projection method for monotone nonlinear equations with convex constraints
• Spectral gradient projection method for solving nonlinear monotone equations
• Spectral gradient methods for linearly constrained optimization
• A projected gradient method for optimization over density matrices
• Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
• Some comments on Wolfe's ‘away step’
• Two-Point Step Size Gradient Methods
• Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
• Inexact spectral projected gradient methods on convex sets
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Spectral projected gradient and variable metric methods for optimization with linear inequalities
• A Nonmonotone Line Search Technique for Newton’s Method
• Algorithm 813
• CUTEr and SifDec
• New analysis and results for the Frank-Wolfe method

This page was built for publication: Inexact variable metric method for convex-constrained optimization problems