A new trust region algorithm for bound constrained minimization
From MaRDI portal
Recommendations
- A Trust Regional Algorithm for Bound Constrained Minimization
- A new trust-region algorithm for nonlinear constrained optimization
- A new trust region algorithm for nonsmooth convex minimization
- A trust region algorithm for constrained optimization
- scientific article; zbMATH DE number 1174501
- A new trust-region algorithm for finite minimax problems
- scientific article; zbMATH DE number 1932312
- A new trust region method for unconstrained optimization
- A trust region algorithm for constrained nonsmooth optimization problems
- A new trust-region algorithm for equality constrained optimization
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Algorithms for bound constrained quadratic programming problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Newton’s Method with a Model Trust Region Modification
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
Cited in
(56)- Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- A hybrid method for solving variational inequality problems
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
- A decomposition method for large-scale box constrained optimization
- An active set algorithm for nonlinear optimization with polyhedral constraints
- The reconstruction of a specially structured Jacobi matrix with an application to damage detection in rods
- Box-constrained minimization reformulations of complementarity problems in second-order cones
- Augmented lagrangians and sphere packing problems
- Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization
- Trust region algorithm with two subproblems for bound constrained problems
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- Solution of linear complementarity problems using minimization with simple bounds
- New constrained optimization reformulation of complementarity problems
- An increasing‐angle property of the conjugate gradient method and the implementation of large‐scale minimization algorithms with line searches
- Mixed Nonlinear Complementarity Problems via Nonlinear Optimization: Numerical Results on Multi-Rigid-Body Contact Problems with Friction
- Combining trust-region and line-search algorithms for minimization subject to bounds
- A trust-region strategy for minimization on arbitrary domains
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- An active set feasible method for large-scale minimization problems with bound constraints
- A MODEL FOR OPTIMAL CHEMICAL CONTROL OF LEAF AREA DAMAGED BY FUNGI POPULATION — PARAMETER DEPENDENCE
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- A trust region method for minimization of nonsmooth functions with linear constraints
- A multivariate spectral projected gradient method for bound constrained optimization
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- On a box-constrained linear symmetric cone optimization problem
- Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization
- Smoothing trust region methods for nonlinear complementarity problems with P₀-functions
- Globally convergent DC trust-region methods
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- A new filter method for solving nonlinear complementarity problems
- Estimation of optical parameters of very thin films
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- A trust region algorithm for a class of nonlinear optimization
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- A Trust Regional Algorithm for Bound Constrained Minimization
- Optimal iterative QP and QPQC algorithms
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- A new strategy for solving variational inequalities in bounded polytopes∗
- A new trust region method for nonsmooth equations
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- scientific article; zbMATH DE number 1215255 (Why is no real title available?)
- A trust region method based on a new affine scaling technique for simple bounded optimization
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
- A feasible direction method for the semidefinite program with box constraints
- Optimal convective heat transfer in double pipe with parabolic fins
- A minimax method with application to the initial vector coding problem*
- An inverse eigenvalue method for frequency isolation in spring–mass systems
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- Topology optimization of continuum structures with material failure constraints
- Topology optimization for minimum mass design considering local failure constraints and contact boundary conditions
- Two-phase model algorithm with global convergence for nonlinear programming
- On the solution of bounded and unbounded mixed complementarity problems
This page was built for publication: A new trust region algorithm for bound constrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337095)
