An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
From MaRDI portal
Publication:461441
DOI10.1007/s10589-013-9597-9zbMath1304.90166OpenAlexW2094221728MaRDI QIDQ461441
Publication date: 10 October 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9597-9
nonconvex programmingseparable structurefilter methodtrust region methodsalternating direction methods
Related Items
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A filter successive linear programming method for nonlinear semidefinite programming problems
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- On filter-successive linearization methods for nonlinear semidefinite programming
- A trust region algorithm for equality constrained optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- 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 variable-penalty alternating directions method for convex optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A new inexact alternating directions method for monotone variational inequalities
- Duality principles in nonconvex systems. Theory, methods and applications
- A modified trust region method with beale's PCG technique for optimization
- Self-adaptive inexact proximal point methods
- Optimization theory and methods. Nonlinear programming
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION
- Global convergence of a filter-trust-region algorithm for solving nonsmooth equations
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- On the Identification of Active Constraints
- Numerical Optimization
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Trust Region Methods
- On optimization techniques for solving nonlinear inverse problems
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- On Large Scale Nonlinear Least Squares Calculations
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- Restoration of Poissonian Images Using Alternating Direction Optimization
- A Filter-Trust-Region Method for Unconstrained Optimization
- Nonlinear programming without a penalty function.
This page was built for publication: An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
