A semidefinite framework for trust region subproblems with applications to large scale minimization
From MaRDI portal
Publication:1373738
zbMATH Open0888.90137MaRDI QIDQ1373738FDOQ1373738
Authors: Franz Rendl, Henry Wolkowicz 
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
trust region subproblemdual simplex type methodminimum eigenvalue problemprimal-dual pairs of semidefinite programs
Large-scale problems in mathematical programming (90C06) Sensitivity, stability, parametric optimization (90C31)
Cited In (87)
- Semidefinite representable reformulations for two variants of the trust-region subproblem
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
- Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
- Robust Maximum Likelihood Estimation
- A block Lanczos method for the extended trust-region subproblem
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem
- On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
- Solving the cubic regularization model by a nested restarting Lanczos method
- Canonical dual approach for minimizing a nonconvex quadratic function over a sphere
- On convergence of the generalized Lanczos trust-region method for trust-region subproblems
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
- A Nested Lanczos Method for the Trust-Region Subproblem
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- (Global) optimization: historical notes and recent developments
- Characterization of solution sets of convex optimization problems in Riemannian manifolds
- Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method
- Convex hull results on quadratic programs with non-intersecting constraints
- Models and algorithms for distributionally robust least squares problems
- QPLIB: a library of quadratic programming instances
- A practical method for solving large-scale TRS
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
- On the spherical quasi-convexity of quadratic functions on spherically subdual convex sets
- A Subspace Minimization Method for the Trust-Region Step
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints
- The generalized trust region subproblem
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds
- Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Semidefinite programming for discrete optimization and matrix completion problems
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Advances in trust region algorithms for constrained optimization
- A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
- A geometric analysis of phase retrieval
- Error bounds of Lanczos approach for trust-region subproblem
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- A second-order cone based approach for solving the trust-region subproblem and its variants
- An efficient algorithm for solving the generalized trust region subproblem
- On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
- A survey of hidden convex optimization
- Title not available (Why is that?)
- A linear-time algorithm for trust region problems
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- Computing quasisolutions of nonlinear inverse problems via efficient minimization of trust region problems
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- A note on lack of strong duality for quadratic problems with orthogonal constraints
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- Quadratic programs with hollows
- A notion of compliance robustness in topology optimization
- Novel reformulations and efficient algorithms for the generalized trust region subproblem
- Semidefinite programming and combinatorial optimization
- A linear-time algorithm for generalized trust region subproblems
- A fast algorithm for globally solving Tikhonov regularized total least squares problem
- Oracle-based robust optimization via online learning
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- A potential reduction approach to the frequency assignment problem
- On the generalized Lanczos trust-region method
- The trust region subproblem and semidefinite programming*
- An iterative algorithm for the conic trust region subproblem
- The generalized trust region subproblem: solution complexity and convex hull results
- Regularization using a parameterized trust region subproblem
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- Kronecker product constraints with an application to the two-trust-region subproblem
- The trust region subproblem with non-intersecting linear constraints
- A trust region method for solving semidefinite programs
- Erratum to: A trust region method for solving semidefinite programs
- On Conic Relaxations of Generalization of the Extended Trust Region Subproblem
- A feasible direction method for image restoration
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
- Global convergence of SSM for minimizing a quadratic over a sphere
- A two-variable approach to the two-trust-region subproblem
- On the complexity of approximating a KKT point of quadratic programming
- Globally solving the trust region subproblem using simple first-order methods
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- A modified trust region method with beale's PCG technique for optimization
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
This page was built for publication: A semidefinite framework for trust region subproblems with applications to large scale minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373738)
