An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- 17 September 2013
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 57 (2) , 365-386
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- A filter successive linear programming method for nonlinear semidefinite programming problemsNumerical Algebra, Control & Optimization, 2012
- Global convergence of a filter-trust-region algorithm for solving nonsmooth equationsInternational Journal of Computer Mathematics, 2010
- A modified trust region method with Beale’s PCG technique for optimizationComputational Optimization and Applications, 2007
- Self-adaptive inexact proximal point methodsComputational Optimization and Applications, 2007
- When Does Learning in Games Generate Convergence to Nash Equilibria? The Role of Supermodularity in an Experimental SettingAmerican Economic Review, 2004
- A new inexact alternating directions method for monotone variational inequalitiesMathematical Programming, 2002
- Nonlinear programming without a penalty functionMathematical Programming, 2002
- On optimization techniques for solving nonlinear inverse problemsInverse Problems, 2000
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert SpaceIMA Journal of Numerical Analysis, 1988
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976