A Smoothing Projected Newton-Type Algorithm for Semi-Infinite Programming

Computational Optimization and Applications - Netherlands
doi 10.1007/s10589-007-9117-x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Semi-Infinite Programming

Lecture Notes in Control and Information Sciences
LibraryInformation Sciences
1979English

Generalized Semi-Infinite Programming: A Tutorial

Journal of Computational and Applied Mathematics
Computational MathematicsApplied Mathematics
2008English

Smoothing Inexact Newton Method for the Second Order Cone Programming

Advances in Applied Mathematics
2015English

A Solution Method for Combined Semi-Infinite and Semi-Definite Programming

ANZIAM Journal
Mathematics
2004English

Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems

Abstract and Applied Analysis
Applied MathematicsAnalysis
2016English

Efficient Algorithm for Solving Semi-Infinite Programming Problems and Their Applications to Nonuniform Filter Bank Designs

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2006English

A Mixed Line Search Smoothing Quasi-Newton Method for Solving Linear Second-Order Cone Programming Problem

ISRN Operations Research
2013English

On Duality Theory of Convex Semi-Infinite Programming

Optimization
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2005English

Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Multiobjective Programming Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy