scientific article
From MaRDI portal
Publication:3552458
zbMath1198.90394MaRDI QIDQ3552458
Ctirad Matonoha, Jan Vlček, Ladislav Lukšan
Publication date: 22 April 2010
Full work available at URL: https://eudml.org/doc/37692
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Large-scale problems in mathematical programming (90C06) Minimax problems in mathematical programming (90C47) Interior-point methods (90C51) Optimality conditions for minimax problems (49K35)
Related Items (5)
Substitution secant/finite difference method to large sparse minimax problems ⋮ Unnamed Item ⋮ An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems ⋮ Group update method for sparse minimax problems ⋮ An active set smoothing method for solving unconstrained minimax problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms with adaptive smoothing for finite minimax problems
- Nonsmooth equations approach to a constrained minimax problem.
- Partitioned variable metric updates for large structured optimization problems
- An interior-point algorithm for nonconvex nonlinear programming
- Corrected sequential linear programming for sparse minimax optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Nonlinear programming and nonsmooth optimization by successive linear programming
- Evaluating Derivatives
- An efficient derivative-free method for solving nonlinear equations
- Variable metric methods for minimizing a class of nondifferentiable functions
- Newton-type methods for unconstrained and linearly constrained optimization
- Three New Rapidly Convergent Algorithms for Finding a Zero of a Function
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- On Steepest Descent
- Smoothing method for minimax problems
This page was built for publication:
