Barrier method in nonsmooth convex optimization without convex representation
From MaRDI portal
(Redirected from Publication:497445)
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
- Convex analysis and nonlinear optimization. Theory and examples.
- Erratum to: ``On convex optimization without convex representation
- Foundations of Optimization
- Generalized Gradients and Applications
- Nonlinear Programming
- On convex optimization without convex representation
- On representations of the feasible set in convex optimization
- Optimality conditions in convex optimization revisited
- Optimization and nonsmooth analysis
Cited in
(8)- Barrier subgradient method
- A barrier method in convex vector optimization with generalized inequality constraints
- On some properties and an application of the logarithmic barrier method
- Optimality conditions and a barrier method in optimization with convex geometric constraint
- scientific article; zbMATH DE number 6027003 (Why is no real title available?)
- Why a Pure Primal Newton Barrier Step May be Infeasible
- On convex optimization without convex representation
- Feasible methods for nonconvex nonsmooth problems with applications in green communications
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)
