Barrier method in nonsmooth convex optimization without convex representation
From MaRDI portal
Publication:497445
DOI10.1007/S11590-014-0811-1zbMATH Open1323.90050OpenAlexW2051968184MaRDI QIDQ497445FDOQ497445
Authors: Joydeep Dutta 
Publication date: 24 September 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0811-1
Recommendations
- On some properties and an application of the logarithmic barrier method
- Barrier subgradient method
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Optimality conditions and a barrier method in optimization with convex geometric constraint
- On convex optimization without convex representation
Cites Work
- Convex Analysis
- Optimization and nonsmooth analysis
- Nonlinear Programming
- Generalized Gradients and Applications
- Convex analysis and nonlinear optimization. Theory and examples.
- Foundations of Optimization
- Erratum to: ``On convex optimization without convex representation
- Optimality conditions in convex optimization revisited
- On convex optimization without convex representation
- On representations of the feasible set in convex optimization
Cited In (8)
- A barrier method in convex vector optimization with generalized inequality constraints
- Optimality conditions and a barrier method in optimization with convex geometric constraint
- Barrier subgradient method
- On some properties and an application of the logarithmic barrier method
- Feasible methods for nonconvex nonsmooth problems with applications in green communications
- On convex optimization without convex representation
- Title not available (Why is that?)
- Why a Pure Primal Newton Barrier Step May be Infeasible
This page was built for publication: Barrier method in nonsmooth convex optimization without convex representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497445)
