A feasible directions method for nonsmooth convex optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4047452
- scientific article; zbMATH DE number 4147420
- scientific article; zbMATH DE number 1925785
- scientific article; zbMATH DE number 67982
- The regularized feasible directions method for nonconvex optimization
- scientific article; zbMATH DE number 123747
- A feasible directions method on combining feasibility with descent for nonlinear constrained optimization
- scientific article; zbMATH DE number 465332
- A unified approach to the feasible direction methods for nonlinear programming with linear constraints
- A new method for nonsmooth convex optimization
Cites work
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Benchmarking optimization software with performance profiles.
- Feasible direction interior-point technique for nonlinear optimization
- Homogeneous analytic center cutting plane methods with approximate centers
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 774556 (Why is no real title available?)
- Methods of descent for nondifferentiable optimization
- Numerical methods for nondifferentiable convex optimization
- On constrained optimization by adjoint based quasi-Newton methods
- On some fundamental properties of structural topology optimization problems
- Optimization and nonsmooth analysis
- Polynomial Interior Point Cutting Plane Methods
- Robust Truss Topology Design via Semidefinite Programming
- Second-order cone programming formulations for a class of problems in structural optimization
- Semidefinite Programming
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(10)- A generalization of the norm-relaxed method of feasible directions
- A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm
- A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints
- scientific article; zbMATH DE number 4149475 (Why is no real title available?)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- A feasible direction algorithm for nonlinear second-order cone programs
- Nonsmooth optimization by Lie bracket approximations into random directions
- The NFDA-nonsmooth feasible directions algorithm applied to constructing Pareto fronts of ridge and Lasso regressions
This page was built for publication: A feasible directions method for nonsmooth convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q381628)