An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
From MaRDI portal
(Redirected from Publication:461441)
Recommendations
- A structured trust region method for nonconvex programming with separable structure
- On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- A trust-region algorithm combining line search filter technique for nonlinear constrained optimization
- A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 5943470 (Why is no real title available?)
- scientific article; zbMATH DE number 3898623 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- A Filter-Trust-Region Method for Unconstrained Optimization
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- A class of quadratically convergent algorithms for constrained function minimization
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A filter successive linear programming method for nonlinear semidefinite programming problems
- A filter trust-region method for unconstrained optimization
- A modified trust region method with beale's PCG technique for optimization
- A new inexact alternating directions method for monotone variational inequalities
- A nonmonotone filter Barzilai-Borwein method for optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- A trust region algorithm for equality constrained optimization
- A variable-penalty alternating directions method for convex optimization
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Application of the alternating direction method of multipliers to separable convex programming problems
- Consensus-based distributed support vector machines
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- Duality principles in nonconvex systems. Theory, methods and applications
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Global convergence of a filter-trust-region algorithm for solving nonsmooth equations
- Learning how to play Nash, potential games and alternating minimization method for structured nonconvex problems on Riemannian manifolds
- Nonlinear programming without a penalty function.
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Numerical Optimization
- On Large Scale Nonlinear Least Squares Calculations
- On filter-successive linearization methods for nonlinear semidefinite programming
- On optimization techniques for solving nonlinear inverse problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Global Convergence of a Filter--SQP Algorithm
- On the Identification of Active Constraints
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- Optimization theory and methods. Nonlinear programming
- Restoration of Poissonian Images Using Alternating Direction Optimization
- Self-adaptive inexact proximal point methods
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Trust Region Methods
Cited in
(3)- An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem
- A new alternating direction method for linearly constrained nonconvex optimization problems
- A structured trust region method for nonconvex programming with separable structure
This page was built for publication: An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q461441)
