Two-Metric Projection Methods for Constrained Optimization
From MaRDI portal
Recommendations
- A regularized two-step projection method for constrained minimization problems
- Projection-iteration methods for solving constrained minimization problems
- scientific article; zbMATH DE number 3874963
- scientific article; zbMATH DE number 4101955
- The projection technique for two open problems of unconstrained optimization problems
- Projection Methods in Conic Optimization
- scientific article; zbMATH DE number 1535452
- A generalized projection-based scheme for solving convex constrained optimization problems
- A generalized metric projection algorithm for optimization problems with nonlinear constraints and superlinear convergence
- Publication:4870427
Cited in
(only showing first 100 items - show all)- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- A modified projection method with a new direction for solving variational inequalities
- Self-adaptive methods for general variational inequalities
- Modified extragradient methods for solving variational inequalities
- A class of superlinearly convergent projection algorithms with relaxed stepsizes
- Monotonicity of metric projection onto positive cones of ordered Euclidean spaces
- A projected Newton method in a Cartesian product of balls
- A projected Newton method for minimization problems with nonlinear inequality constraints
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods
- Using an interior point method for the master problem in a decomposition approach
- Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Interior point methods for optimal control of discrete time systems
- A class of iterative methods for solving nonlinear projection equations
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Equivalence of variational inequality problems to unconstrained minimization
- Convexity of the implicit Lagrangian
- Convergence analysis of perturbed feasible descent methods
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- A closer look at consistent operator splitting and its extensions for topology optimization
- Local convergence analysis of projection-type algorithms: unified approach
- On the convergence of projected gradient processes to singular critical points
- Some recent advances in projection-type methods for variational inequalities
- A modified augmented Lagrangian method for a class of monotone variational inequalities
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- On linear convergence of iterative methods for the variational inequality problem
- NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods
- A modified Solodov-Svaiter method for solving nonmonotone variational inequality problems
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- A projection descent method for solving variational inequalities
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- Neural network models and its application for solving linear and quadratic programming problems
- An additional projection step to He and Liao's method for solving variational inequalities
- Modified descent-projection method for solving variational inequalities
- Convergence rate of a modified extragradient method for pseudomonotone variational inequalities
- Global convergence of a modified gradient projection method for convex constrained problems
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- A projection method for a system of nonlinear monotone equations with convex constraints
- A simple self-adaptive alternating direction method for linear variational inequality problems
- A bundle-type algorithm for routing in telecommunication data networks
- Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions
- Primal-dual splittings as fixed point iterations in the range of linear operators
- An automatic L₁-based regularization method for the analysis of FFC dispersion profiles with quadrupolar peaks
- New properties of forward-backward splitting and a practical proximal-descent algorithm
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- An algorithm for finding an optimal projection of a symmetric matrix onto a diagonal matrix
- Modified projection method for general variational inequalities
- On a new numerical method for solving general variational inequalities
- Douglas-Rachford splitting method for semidefinite programming
- scientific article; zbMATH DE number 2187217 (Why is no real title available?)
- Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions
- On convergence degree estimation for a projection-iteration method of solving a constrained minimization problem
- A convergence analysis result for constrained convex minimization problem
- On the rate of convergence of projected Barzilai-Borwein methods
- An algorithm for quadratic _1-regularized optimization with a flexible active-set strategy
- Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization
- Projected gradient methods for linearly constrained problems
- A regularized gradient projection method for the minimization problem
- An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Strong convergence of a projected gradient method
- Variant gradient projection methods for the minimization problems
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- Robust least square semidefinite programming with applications
- scientific article; zbMATH DE number 1873048 (Why is no real title available?)
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Split-Douglas-Rachford algorithm for composite monotone inclusions and split-ADMM
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- An iterative reduction FISTA algorithm for large-scale LASSO
- Convergence rate of a gradient projection method for solving variational inequalities
- PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization
- Globalization technique for projected Newton-Krylov methods
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
- A potential reduction algorithm for linearly constrained convex programming
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- Bounded perturbation resilience of projected scaled gradient methods
- The relaxed inexact projection methods for the split feasibility problem
- A Bregman–Kaczmarz method for nonlinear systems of equations
- Quasi-Newton projection methods and the discrepancy principle in image restoration
- A projected gradient trust-region method for solving nonlinear systems with convex constraints
- An efficient trust region algorithm with bounded iteration sequence for unconstrained optimization and its application in support vector machine
- Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions
- Using central prices in the decomposition of linear programs
- A fully relaxed Tseng's splitting method
- Line-search based optimization using function approximations with tunable accuracy
- Relaxed and inertial nonlinear forward-backward with momentum
- Algorithms for solving fixed point problems involving quasi-pseudocontractive mappings
- Modified projection method for solving a system of monotone equations with convex constraints
- Two-step inertial projection and contraction algorithm for nonmonotone variational inequalities with Lipschitz continuous operators
- Feature-based network construction: from sampling to what-if analysis
- A smoothing augmented Lagrangian method for solving simple bilevel programs
This page was built for publication: Two-Metric Projection Methods for Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220362)
