Nonmonotone line search for minimax problems
From MaRDI portal
Publication:1321311
DOI10.1007/BF00939377zbMath0792.90079OpenAlexW2053983905MaRDI QIDQ1321311
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00939377
sequential quadratic programmingminimax problemssuperlinear convergenceMaratos effectsmooth constrained optimization
Related Items (36)
A nonmonotonic hybrid algorithm for min-max problem ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ A modified SQP algorithm for minimax problems ⋮ Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints ⋮ Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ A sequential quadratic programming algorithm for nonlinear minimax problems ⋮ A new computational method for the functional inequality constrained minimax optimization problem ⋮ The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ An extended nonmonotone line search technique for large-scale unconstrained optimization ⋮ CFD-based optimization of hovering rotors using radial basis functions for shape parameterization and mesh deformation ⋮ Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization ⋮ Inexact smoothing method for large scale minimax optimization ⋮ Nonmonotone algorithm for minimax optimization problems ⋮ An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems ⋮ CFD-based optimization of aerofoils using radial basis functions for domain element parameterization and mesh deformation ⋮ An adaptive nonmonotone trust-region method with curvilinear search for minimax problem ⋮ A nonmonotone line search based algorithm for distribution center location selected ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ A new superlinearly convergent SQP algorithm for nonlinear minimax problems ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ A new nonmonotone line search technique for unconstrained optimization ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ Wing aerodynamic optimization using efficient mathematically-extracted modal design variables ⋮ On the nonmonotone line search ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems ⋮ Nonmonotone line search algorithm for constrained minimax problems ⋮ An improved SQP algorithm for solving minimax problems ⋮ A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem ⋮ Generalised monotone line search algorithm for degenerate nonlinear minimax problems ⋮ A sequential quadratically constrained quadratic programming method for unconstrained minimax problems ⋮ Improved filter-SQP algorithm with active set for constrained minimax problems ⋮ Algorithms for optimal signal set design
Cites Work
- An algorithm for composite nonsmooth optimization problems
- Test examples for nonlinear programming codes
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Smooth Optimization Methods for Minimax Problems
- Variable metric methods for minimizing a class of nondifferentiable functions
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A surperlinearly convergent algorithm for constrained optimization problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- Linearly constrained minimax optimization
- An Efficient Method to Solve the Minimax Problem Directly
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- A Nonmonotone Line Search Technique for Newton’s Method
- Unnamed Item
- Unnamed Item
This page was built for publication: Nonmonotone line search for minimax problems
