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

Annals of Operations Research - Netherlands
doi 10.1007/s10479-019-03143-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Inner Approximation Method for a Reverse Convex Programming Problem

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

Optimality Conditions for a Cone-Convex Programming Problem

Journal of the Australian Mathematical Society
Mathematics
1979English

A Smoothing Penalty Function Method for the Constrained Optimization Problem

Open Journal of Optimization
2019English

A Weighted Mirror Descent Algorithm for Nonsmooth Convex Optimization Problem

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

A Bundle-Filter Method for Nonsmooth Convex Constrained Optimization

Mathematical Programming, Series B
MathematicsSoftware
2007English

A Primal-Dual Interior-Point Method for the Semidefinite Programming Problem Based on a New Kernel Function

Journal of Nonlinear Functional Analysis
ControlNumerical AnalysisAlgebraGeometryFluid FlowAnalysisNumber TheoryOptimizationTransfer ProcessesTopology
2019English

A Line Search Multigrid Method for Large-Scale Convex Optimization

2007English

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

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1998English

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

Journal of Applied Mathematics
Applied Mathematics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy