GQTPAR
From MaRDI portal
Software:19481
No author found.
Related Items (only showing first 100 items - show all)
A new active-set strategy for NCP with degenerate solutions ⋮ On the solution of a two ball trust region subproblem ⋮ A new predictor-corrector method for solving unconstrained minimization problems ⋮ A linear-time algorithm for trust region problems ⋮ On piecewise quadratic Newton and trust region problems ⋮ A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems ⋮ Convergence rate of the trust region method for nonlinear equations under local error bound condition ⋮ Approximate solution of the trust region problem by minimization over two-dimensional subspaces ⋮ Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres ⋮ A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy ⋮ Solving a class of linearly constrained indefinite quadratic problems by DC algorithms ⋮ A modified nearly exact method for solving low-rank trust region subproblem ⋮ Parallel quasi-Newton methods for unconstrained optimization ⋮ A constrained eigenvalue problem ⋮ Projected Tikhonov regularization of large-scale discrete ill-posed problems ⋮ Algorithms for bound constrained quadratic programming problems ⋮ On the generalized discrepancy principle for Tikhonov regularization in Hilbert scales ⋮ A model-hybrid approach for unconstrained optimization problems ⋮ Convex optimization approach to a single quadratically constrained quadratic minimization problem ⋮ A mathematical biography of Danny C. Sorensen ⋮ Limited-memory BFGS systems with diagonal updates ⋮ Inexact smoothing method for large scale minimax optimization ⋮ Inexact trust region PGC method for large sparse unconstrained optimization ⋮ Projected quasi-Newton algorithm with trust region for constrained optimization ⋮ An alternating variable method for the maximal correlation problem ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ The generalized trust region subproblem ⋮ Convergence properties of trust region methods for linear and convex constraints ⋮ On a subproblem of trust region algorithms for constrained optimization ⋮ Constructing composite search directions with parameters in quadratic interpolation models ⋮ Construction and optimization of a texture-geometric model of a face image in the space of basic Gabor functions ⋮ A working set SQCQP algorithm with simple nonmonotone penalty parameters ⋮ Optimal convective heat transfer in double pipe with parabolic fins ⋮ An algorithm for solving new trust region subproblem with conic model ⋮ A hybrid method for the nonlinear least squares problem with simple bounds ⋮ On solving \(L_{q}\)-penalized regressions ⋮ Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations. ⋮ An interior point algorithm to solve computationally difficult set covering problems ⋮ The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint ⋮ Strong duality for generalized trust region subproblem: S-lemma with interval bounds ⋮ On fast trust region methods for quadratic models with linear constraints ⋮ On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls ⋮ MANPAK: A set of algorithms for computations on implicitly defined manifolds ⋮ Large-scale history matching with quadratic interpolation models ⋮ Local nonglobal minima for solving large-scale extended trust-region subproblems ⋮ On solving L-SR1 trust-region subproblems ⋮ Nonmonotone trust region methods with curvilinear path in unconstrained optimization ⋮ A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ Computation of a trust region step ⋮ Trust-region methods for nonlinear elliptic equations with radial basis functions ⋮ A continuous approach to inductive inference ⋮ Regularization using a parameterized trust region subproblem ⋮ Variable-number sample-path optimization ⋮ A new zero-finder for Tikhonov regularization ⋮ A quasi-Gauss-Newton method for solving nonlinear algebraic equations ⋮ Data analysis for the NASA EOS aura microwave limb sounder instrument ⋮ Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ A retrospective trust-region method for unconstrained optimization ⋮ A nonmonotone filter method for nonlinear optimization ⋮ A practical method for solving large-scale TRS ⋮ An iterative method for solving semismooth equations ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization ⋮ An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization ⋮ CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm ⋮ On solving trust-region and other regularised subproblems in optimization ⋮ Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization ⋮ Solving regularized total least squares problems based on eigenproblems ⋮ A direct active set algorithm for large sparse quadratic programs with simple bounds ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ Error bounds of Lanczos approach for trust-region subproblem ⋮ Diffusion representations ⋮ An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization ⋮ Convexity of Gaussian chance constraints and of related probability maximization problems ⋮ Optimal prediction pools ⋮ Distance-based discriminant analysis method and its applications ⋮ Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities ⋮ Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization ⋮ On Lagrange multipliers of trust-region subproblems ⋮ New optimality conditions for quadratic optimization problems with binary constraints ⋮ BFGS trust-region method for symmetric nonlinear equations ⋮ A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results ⋮ A restricted trust region algorithm for unconstrained optimization ⋮ Block relaxation and majorization methods for the nearest correlation matrix with factor structure ⋮ Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid ⋮ Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization ⋮ Newton-Krylov type algorithm for solving nonlinear least squares problems ⋮ Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming ⋮ A framework for globally convergent algorithms using gradient bounding functions ⋮ Tensor methods for large sparse systems of nonlinear equations ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions ⋮ Backward error bounds for constrained least squares problems ⋮ Advances in trust region algorithms for constrained optimization ⋮ A QP-free constrained Newton-type method for variational inequality problems ⋮ Scaled optimal path trust-region algorithm ⋮ Interior-point algorithms for global optimization ⋮ Algorithms for the solution of quadratic knapsack problems ⋮ A model trust-region modification of Newton's method for nonlinear two- point boundary-value problems
This page was built for software: GQTPAR
