An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems With Many Objective Functions

SIAM Journal on Optimization - United States
doi 10.1137/0806025
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Improved Filter-SQP Algorithm With Active Set for Constrained Minimax Problems

Journal of Applied Mathematics
Applied Mathematics
2014English

An Algorithm for the Global Optimization of a Class of Continuous Minimax Problems

Journal of Optimization Theory and Applications
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2008English

Minimax Location Problems With Nonlinear Costs

Journal of Research of the National Bureau of Standards
1977English

An Implementable SAA Nonlinear Lagrange Algorithm for Constrained Minimax Stochastic Optimization Problems

Mathematical Problems in Engineering
MathematicsEngineering
2018English

On Noncooperative Games, Minimax Theorems, and Equilibrium Problems

Springer Optimization and Its Applications
ControlOptimization
2008English

Minimax-Robust Estimation Problems for Stationary Stochastic Sequences

Statistics, Optimization and Information Computing
ControlInformation SystemsPattern RecognitionProbabilityUncertaintyComputer VisionOptimizationStatisticsSignal ProcessingArtificial Intelligence
2015English

A Nonlinear Lagrange Algorithm for Stochastic Minimax Problems Based on Sample Average Approximation Method

Journal of Applied Mathematics
Applied Mathematics
2014English

Minimax Approximate Solutions of Linear Boundary Value Problems

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1979English

Optimality and Parametric Duality for Nonsmooth Minimax Fractional Programming Problems Involving L-Invex-Infine Functions

Pesquisa Operacional
Management ScienceOperations Research
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy