Inner Approximation Method for a Reverse Convex Programming Problem

Journal of Optimization Theory and Applications - United States
doi 10.1023/a:1026456730792
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Optimality Conditions for a Cone-Convex Programming Problem

Journal of the Australian Mathematical Society
Mathematics
1979English

Inner Approximation Algorithm for Generalized Linear Multiplicative Programming Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2018English

Polynomial Approximation Method for Stochastic Programming.

English

A Randomized Method for Handling a Difficult Function in a Convex Optimization Problem, Motivated by Probabilistic Programming

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2019English

Iterative Algorithms Based on the Viscosity Approximation Method for Equilibrium and Constrained Convex Minimization Problem

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2012English

An Inner Approximation Method to Compute the Weight Set Decomposition of a Triobjective Mixed-Integer Problem

Journal of Global Optimization
ControlOptimizationApplied MathematicsManagement ScienceComputer Science ApplicationsOperations Research
2020English

An Approximation Method for Solving Nonconvex Quadratic Programming Problems

Journal of Applied Sciences
2011English

A General Approximation Method for a Kind of Convex Optimization Problems in Hilbert Spaces

Journal of Applied Mathematics
Applied Mathematics
2014English

A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy