A simple alternating direction method for the conic trust region subproblem
From MaRDI portal
Publication:1721084
DOI10.1155/2018/5358191zbMath1427.90296OpenAlexW2904251585WikidataQ128722853 ScholiaQ128722853MaRDI QIDQ1721084
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/5358191
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items (1)
Uses Software
Cites Work
- On the linear convergence of the alternating direction method of multipliers
- A class of ADMM-based algorithms for three-block separable convex programming
- Projected quasi-Newton algorithm with trust region for constrained optimization
- A trust region algorithm for equality constrained optimization
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Two new unconstrained optimization algorithms which use function and gradient values
- A variable-penalty alternating directions method for convex optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- A new inexact alternating directions method for monotone variational inequalities
- Alternating direction method of multipliers for separable convex optimization of real functions in complex variables
- Real-time pricing for demand response in smart grid based on alternating direction method of multipliers
- Generalized symmetric ADMM for separable convex optimization
- Subspace trust-region algorithm with conic model for unconstrained optimization
- A new trust region dogleg method for unconstrained optimization
- An alternating direction method of multipliers for elliptic equation constrained optimization problem
- A quasi-Newton trust region method with a new conic model for the unconstrained optimization
- Proximal alternating directions method for structured variational inequalities
- A CONIC AFFINE SCALING DOGLEG METHOD FOR NONLINEAR OPTIMIZATION WITH BOUND CONSTRAINTS
- Damped techniques for enforcing convergence of quasi-Newton methods
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach
- A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation
- A Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression
- Conic Approximations and Collinear Scalings for Optimizers
- Testing Unconstrained Optimization Software
- Computing Optimal Locally Constrained Steps
- Newton’s Method with a Model Trust Region Modification
- Algorithms for nonlinear constraints that use lagrangian functions
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
- A new alternating direction trust region method based on conic model for solving unconstrained optimization
- A Conic Algorithm for Optimization
- Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
- A conic trust-region method for nonlinearly constrained optimization
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A simple alternating direction method for the conic trust region subproblem
