An Algorithm of Successive Minimization in Convex Programming

RAIRO. Analyse numérique
doi 10.1051/m2an/1978120403771
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EDP Sciences

Related search

An Algorithm for Indefinite Quadratic Programming With Convex Constraints

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
1991English

An Effective Branch-And-Bound Algorithm for Convex Quadratic Integer Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

A Porosity Result in Convex Minimization

Abstract and Applied Analysis
Applied MathematicsAnalysis
2005English

Disciplined Convex Programming

English

Multicut L-Shaped Algorithm for Stochastic Convex Programming With Fuzzy Probability Distribution

Open Journal of Applied Sciences
2012English

A Primal-Dual Fixed Point Algorithm for Minimization of the Sum of Three Convex Separable Functions

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2016English

Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems With Generalized Mixed Equilibrium Problems

Journal of Function Spaces and Applications
2012English

Explicit Solutions in Convex Goal Programming

Management Science
Management ScienceManagementOperations ResearchStrategy
1975English

Least-Norm Linear Programming Solution as an Unconstrained Minimization Problem.

1980English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy