An interior-point trust-region algorithm to solve a finite nonlinear minimax problem
From MaRDI portal
Cites work
- A compact variable metric algorithm for nonlinear minimax approximation
- A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem.
- A hybrid algorithm for nonlinear minimax problems
- A modified SQP algorithm for minimax problems
- A multiplier active-set trust-region algorithm for solving constrained optimization problem
- A new trust region method for nonlinear equations involving fractional mode
- A new trust-region algorithm for nonlinear constrained optimization
- A penalty method with trust-region mechanism for nonlinear bilevel optimization problem
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- A smoothing trust-region Newton-CG method for minimax problem
- A stochastic trust region method for unconstrained optimization problems
- A trust region method based on a new affine scaling technique for simple bounded optimization
- A trust region method based on interior point techniques for nonlinear programming.
- A Trust-Region Algorithm for Solving Mini-Max Problem
- A trust-region algorithm with adaptive stochastic collocation for PDE optimization under uncertainty
- Algorithms with adaptive smoothing for finite minimax problems
- An active-set algorithm and a trust-region approach in constrained minimax problem
- An active-set interior-point trust-region algorithm
- An augmented Lagrangian trust region method for equality constrained optimization
- An efficient implementation of a trust region method for box constrained optimization
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- An interior-point algorithm for large-scale nonlinear optimization with inexact step computations
- An interior-point penalty active-set trust-region algorithm
- Benchmarking optimization software with performance profiles.
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3934328 (Why is no real title available?)
- scientific article; zbMATH DE number 3666545 (Why is no real title available?)
- scientific article; zbMATH DE number 1932369 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- New exact penalty function for solving constrained finite min-max problems
- Nonlinear Programming
- Nonmonotone line search algorithm for constrained minimax problems
- Nonmonotone line search for minimax problems
- On the convergence of a new trust region algorithm
- Optimization. Algorithms and consistent approximations
- Smoothing method for minimax problems
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- Trust Region Methods
This page was built for publication: An interior-point trust-region algorithm to solve a finite nonlinear minimax problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257133)
