GASPACHO: A Generic Automatic Solver Using Proximal Algorithms for Convex Huge Optimization Problems

doi 10.1117/12.2274424
Full Text
Abstract

Available in full text

Date
Authors
Publisher

SPIE

Related search

A Proximal Point Method for Nonsmooth Convex Optimization Problems in Banach Spaces

Abstract and Applied Analysis
Applied MathematicsAnalysis
1997English

Disparity Map Estimation Under Convex Constraints Using Proximal Algorithms

2011English

A Proximal Cutting Plane Method Using Chebychev Center for Nonsmooth Convex Optimization

Mathematical Programming, Series B
MathematicsSoftware
2008English

On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1996English

Convex Methods for Rank-Constrained Optimization Problems

2015English

Evolutionary Algorithms for Dynamic Optimization Problems

2005English

Distributed Algorithms for Convex Problems With Linear Coupling Constraints

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

Some Optimization Problems for the Minimal Annulus of a Convex Set

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2006English

Local Search for Parallel Optimization Algorithms for High Diminsional Optimization Problems

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy