Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
From MaRDI portal
Publication:2375484
DOI10.1155/2013/295147zbMath1266.65099OpenAlexW2064949600WikidataQ59005199 ScholiaQ59005199MaRDI QIDQ2375484
Tian-de Guo, Tingting Feng, Guo-Ping He, Cong-Ying Han
Publication date: 14 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/295147
Related Items (8)
Fast algorithms for sparse inverse covariance estimation ⋮ Efficient parameters estimation method for the separable nonlinear least squares problem ⋮ 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 ⋮ On Smoothingl1Exact Penalty Function for Constrained Optimization Problems ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Parallel SSLE algorithm for large scale constrained optimization
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem
- A modified SQP method with nonmonotone technique and its global convergence
- A truncated Newton method with non-monotone line search for unconstrained optimization
- New inexact parallel variable distribution algorithms
- Parallel variable distribution for constrained optimization
- Dual coordinate ascent methods for non-strictly convex minimization
- A variant of SQP method for inequality constrained optimization and its global convergence
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- Parallel Constraint Distribution
- Parallel Variable Transformation in Unconstrained Optimization
- On the Convergence of Constrained Parallel Variable Distribution Algorithms
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- Nonlinear programming without a penalty function.
This page was built for publication: Parallel variable distribution algorithm for constrained optimization with nonmonotone technique