scientific article
From MaRDI portal
Publication:3681854
zbMath0566.65048MaRDI QIDQ3681854
M. R. Celis, John E. jun. Dennis, Richard A. Tapia
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global convergencenumerical resultstrust region methodnonlinear constrained optimizationquadratic programming subproblemSQP-method
Related Items (84)
A trust-region algorithm for equality-constrained optimization via a reduced dimension approach. ⋮ On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ On the complexity of quadratic programming with two quadratic constraints ⋮ A convergent secant method for constrained optimization ⋮ CDT like approaches for the system of nonlinear equations ⋮ A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization ⋮ A projective quasi-Newton method for nonlinear optimization ⋮ A trust-region strategy for minimization on arbitrary domains ⋮ Trust region algorithms for the nonlinear least distance problem ⋮ Computing the Signed Distance Between Overlapping Ellipsoids ⋮ On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization ⋮ Numerical experience with a polyhedral-norm CDT trust-region algorithm ⋮ Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization ⋮ Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization ⋮ Approximate solution of the trust region problem by minimization over two-dimensional subspaces ⋮ An efficient algorithm for solving the generalized trust region subproblem ⋮ A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy ⋮ Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems ⋮ A computational study of global optimization solvers on two trust region subproblems ⋮ A trust-region-based BFGS method with line search technique for symmetric nonlinear equations ⋮ Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems ⋮ On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem ⋮ A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints ⋮ Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem. ⋮ On the use of piecewise linear models in nonlinear programming ⋮ Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem ⋮ Canonical coordinates method for equality-constrained nonlinear optimization. ⋮ Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow ⋮ Accelerating the quadratic lower-bound algorithm via optimizing the shrinkage parameter ⋮ Subspace choices for the Celis-Dennis-Tapia problem ⋮ Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem ⋮ Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem ⋮ Global convergence of a nonmonotone filter method for equality constrained optimization ⋮ A new semidefinite programming relaxation scheme for a class of quadratic matrix problems ⋮ On a subproblem of trust region algorithms for constrained optimization ⋮ Krylov subspace recycling for sequences of shifted linear systems ⋮ A trust region algorithm for equality constrained optimization ⋮ Reaction-diffusion systems in protein networks: global existence and identification ⋮ Inexact-restoration algorithm for constrained optimization ⋮ A trust-region method by active-set strategy for general nonlinear optimization ⋮ The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction ⋮ Efficient local search procedures for quadratic fractional programming problems ⋮ Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization ⋮ A nonmonotone filter trust region method for nonlinear constrained optimization ⋮ An active-set algorithm and a trust-region approach in constrained minimax problem ⋮ Optimization Algorithms ⋮ New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem ⋮ Globally solving nonconvex quadratic programming problems via completely positive programming ⋮ An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints ⋮ A feasible trust-region algorithm for inequality constrained optimization ⋮ A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization ⋮ An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization ⋮ Global convergence of SSM for minimizing a quadratic over a sphere ⋮ Conic approximation to nonconvex quadratic programming with convex quadratic constraints ⋮ Chebyshev center of the intersection of balls: complexity, relaxation and approximation ⋮ Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming ⋮ A Note on Polynomial Solvability of the CDT Problem ⋮ Some results for quadratic problems with one or two quadratic constraints ⋮ An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem ⋮ Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints ⋮ Flexible and deflated variants of the block shifted GMRES method ⋮ A Two-Variable Approach to the Two-Trust-Region Subproblem ⋮ The trust region subproblem with non-intersecting linear constraints ⋮ Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension ⋮ A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization ⋮ Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere ⋮ Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming ⋮ Solving Generalized CDT Problems via Two-Parameter Eigenvalues ⋮ BFGS trust-region method for symmetric nonlinear equations ⋮ Nonmonotonic projected algorithm with both trust region and line search for constrained optimization ⋮ A subspace SQP method for equality constrained optimization ⋮ A hybrid algorithm for the two-trust-region subproblem ⋮ Tilt stability for quadratic programs with one or two quadratic inequality constraints ⋮ Convergence properties of improved secant methods with region multiplier ⋮ Quadratic optimization with two ball constraints ⋮ Advances in trust region algorithms for constrained optimization ⋮ A note on lack of strong duality for quadratic problems with orthogonal constraints ⋮ On local nonglobal minimum of trust-region subproblem and extension ⋮ An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints ⋮ Recent advances in trust region algorithms ⋮ An interior method for nonconvex semidefinite programs
This page was built for publication:
