Pages that link to "Item:Q2910881"

The following pages link to A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization (Q2910881):

Displaying 41 items.

• Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
• Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
• An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
• A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
• A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
• An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty (Q2071422) (← links)
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
• A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
• A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization (Q2438434) (← links)
• On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems (Q2674587) (← links)
• An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
• Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
• Linear models for the impact of order flow on prices. II. The Mixture Transition Distribution model (Q4554472) (← links)
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints (Q4631819) (← links)
• A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
• (Q4969108) (← links)
• Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions (Q5038179) (← links)
• A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
• A New Sequential Optimality Condition for Constrained Nonsmooth Optimization (Q5114399) (← links)
• Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation (Q5116556) (← links)
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
• Cost-Effective Robust Stabilization and Bifurcation Suppression (Q5232222) (← links)
• A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles (Q5268896) (← links)
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
• Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)
• A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization (Q5865916) (← links)
• SOBMOR: Structured Optimization-Based Model Order Reduction (Q6039262) (← links)
• An Improved Unconstrained Approach for Bilevel Optimization (Q6076870) (← links)
• A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective (Q6093282) (← links)
• New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)
• Fast optimization of viscosities for frequency‐weighted damping of second‐order systems (Q6202643) (← links)
• Modified gradient sampling algorithm for nonsmooth semi-infinite programming (Q6578198) (← links)
• Game-theoretic multi-agent motion planning in a mixed environment (Q6636939) (← links)
• MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization (Q6642790) (← links)