scientific article
From MaRDI portal
Publication:3057247
zbMath1204.49022MaRDI QIDQ3057247
Jan Vlček, Ctirad Matonoha, Ladislav Lukšan
Publication date: 24 November 2010
Full work available at URL: https://eudml.org/doc/196755
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
unconstrained optimizationglobal convergencenonsmooth optimizationlarge-scale optimizationcomputational experimentsvariable metric methodsinterior-point methodsmodified Newton methodsgeneralized minimax optimization
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 (2)
Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems ⋮ Two limited-memory optimization methods with minimum violation of the previous secant conditions
Uses Software
Cites Work
- Partitioned variable metric updates for large structured optimization problems
- An interior-point algorithm for nonconvex nonlinear programming
- Smooth transformation of the generalized minimax problem
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Interior‐point method for non‐linear non‐convex optimization
- Estimation of sparse hessian matrices and graph coloring problems
- An efficient derivative-free method for solving nonlinear equations
- Newton-type methods for unconstrained and linearly constrained optimization
- Three New Rapidly Convergent Algorithms for Finding a Zero of a Function
- Trust-region interior-point method for large sparsel1optimization
- Smoothing method for minimax problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
