Inexact variable metric method for convex-constrained optimization problems
From MaRDI portal
Recommendations
- A variable metric method for nonsmooth convex constrained optimization
- scientific article; zbMATH DE number 3852805
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- scientific article; zbMATH DE number 4156217
- A Class of Inexact Variable Metric Proximal Point Algorithms
- scientific article; zbMATH DE number 3682547
- scientific article; zbMATH DE number 822149
- The convergence of variable metric matrices in unconstrained optimization
- Variable metric primal-dual method for convex optimization problems with changing constraints
Cites work
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- scientific article; zbMATH DE number 554512 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A projected gradient method for optimization over density matrices
- Algorithm 813
- An inexact primal-dual path following algorithm for convex quadratic SDP
- CUTEr and SifDec
- Computing a nearest symmetric positive semidefinite matrix
- Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
- Convergence properties of nonmonotone spectral projected gradient methods
- Inexact spectral projected gradient methods on convex sets
- Least-squares solution of \(F=PG\) over positive semidefinite symmetric \(P\)
- MINQ8: general definite and bound constrained indefinite quadratic programming
- New analysis and results for the Frank-Wolfe method
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the use of the spectral projected gradient method for support vector machines
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Some comments on Wolfe's ‘away step’
- Spectral gradient methods for linearly constrained optimization
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Spectral gradient projection method for solving nonlinear monotone equations
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints
- Two spectral gradient projection methods for constrained equations and their linear convergence rate
- Two-Point Step Size Gradient Methods
Cited in
(13)- scientific article; zbMATH DE number 1293853 (Why is no real title available?)
- scientific article; zbMATH DE number 1150371 (Why is no real title available?)
- scientific article; zbMATH DE number 4156217 (Why is no real title available?)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- scientific article; zbMATH DE number 4180681 (Why is no real title available?)
- A variable metric method for nonsmooth convex constrained optimization
- On the inexact scaled gradient projection method
- Variable metric inexact line-search-based methods for nonsmooth optimization
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- scientific article; zbMATH DE number 3852805 (Why is no real title available?)
- scientific article; zbMATH DE number 5802263 (Why is no real title available?)
- scientific article; zbMATH DE number 4041642 (Why is no real title available?)
This page was built for publication: Inexact variable metric method for convex-constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034933)
