An Alternating Linearization Bundle Method for a Class of Nonconvex Nonsmooth Optimization Problems

Journal of Inequalities and Applications - United Kingdom
doi 10.1186/s13660-018-1683-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

A Bundle-Filter Method for Nonsmooth Convex Constrained Optimization

Mathematical Programming, Series B
MathematicsSoftware
2007English

Stabilization via Nonsmooth, Nonconvex Optimization

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2006English

Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

A BFGS-SQP Method for Nonsmooth, Nonconvex, Constrained Optimization and Its Evaluation Using Relative Minimization Profiles

Optimization Methods and Software
ControlApplied MathematicsOptimizationSoftware
2016English

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

Abstract and Applied Analysis
Applied MathematicsAnalysis
1997English

Linear Decomposition Approach for a Class of Nonconvex Programming Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2017English

Nonconvex Robust Optimization for Problems With Constraints

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2010English

An Approximation Method for Solving Nonconvex Quadratic Programming Problems

Journal of Applied Sciences
2011English

On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy