Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
Summary: A modified parallel variable distribution (PVD) algorithm for solving large-scale constrained optimization problems is developed, which modifies quadratic subproblem \(QP_l\) at each iteration instead of the \(QP^0_l\) of the SQP-type PVD algorithm proposed by C. A. Sagastizábal and M. V. Solodov in 2002. The algorithm can circumvent the difficulties associated with the possible inconsistency of \(QP^0_l\) subproblem of the original SQP method. Moreover, we introduce a nonmonotone technique instead of the penalty function to carry out the line search procedure with more flexibly. Under appropriate conditions, the global convergence of the method is established. In the final part, parallel numerical experiments are implemented on CUDA based on GPU (Graphics Processing unit).
- A computationally efficient feasible sequential quadratic programming algorithm
- A modified SQP method with nonmonotone technique and its global convergence
- A Nonmonotone Line Search Technique for Newton’s Method
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A variant of SQP method for inequality constrained optimization and its global convergence
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Dual coordinate ascent methods for non-strictly convex minimization
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- New inexact parallel variable distribution algorithms
- Nonlinear programming without a penalty function.
- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem
- On the Convergence of Constrained Parallel Variable Distribution Algorithms
- Parallel Constraint Distribution
- Parallel SSLE algorithm for large scale constrained optimization
- Parallel variable distribution for constrained optimization
- Parallel Variable Transformation in Unconstrained Optimization
- Shrinking gradient descent algorithms for total variation regularized image denoising
- Hybrid variational model based on alternating direction method for image restoration
- Image restoration by a mixed high-order total variation and \(l_1\) regularization model
- A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse
- Sequential quadratic programming method for nonlinear least squares estimation and its application
- Efficient parameters estimation method for the separable nonlinear least squares problem
- A parallel algorithm based on QP-free for constrained optimizations
- On smoothing $l_1$ exact penalty function for constrained optimization problems
- A modified SQP parallel variable distribution algorithm
- Fast algorithms for sparse inverse covariance estimation
- Two parallel distribution algorithms for convex constrained minimization problems
This page was built for publication: Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375484)
