A feasible directions method for nonsmooth convex optimization

DOI10.1007/s00158-011-0634-yzbMath1274.90261OpenAlexW2043842131MaRDI QIDQ381628

Wilhelm P. Freire, Alfredo Canelas, José Herskovits, Tanaka Fo Mario

Publication date: 15 November 2013

Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00158-011-0634-y

zbMATH Keywords

nonsmooth optimizationcutting planes methodfeasible direction interior point methodsunconstrained convex optimization

Mathematics Subject Classification ID

Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56) Interior-point methods (90C51)

Related Items (4)

A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ A feasible direction algorithm for nonlinear second-order cone programs

Uses Software

• JDQR
• PLCP
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Second-order cone programming formulations for a class of problems in structural optimization
• On some fundamental properties of structural topology optimization problems
• Feasible direction interior-point technique for nonlinear optimization
• Methods of descent for nondifferentiable optimization
• The Cutting-Plane Method for Solving Convex Programs
• Optimization and nonsmooth analysis
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Robust Truss Topology Design via Semidefinite Programming
• On constrained optimization by adjoint based quasi-Newton methods
• A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
• Homogeneous analytic center cutting plane methods with approximate centers
• Templates for the Solution of Algebraic Eigenvalue Problems
• Polynomial Interior Point Cutting Plane Methods
• Numerical methods for nondifferentiable convex optimization
• Semidefinite Programming
• Benchmarking optimization software with performance profiles.

This page was built for publication: A feasible directions method for nonsmooth convex optimization