Pages that link to "Item:Q4441953"

The following pages link to A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties (Q4441953):

Displaying 48 items.

• A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
• Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
• Globally convergent cutting plane method for nonconvex nonsmooth minimization (Q535081) (← links)
• Primal-dual interior-point method for thermodynamic gas-particle partitioning (Q538298) (← links)
• An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
• Sequential systems of linear equations method for general constrained optimization without strict complementarity (Q557781) (← links)
• An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
• A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints (Q668747) (← links)
• Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols (Q868558) (← links)
• A note on the use of vector barrier parameters for interior-point methods (Q877030) (← links)
• Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
• An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness (Q904955) (← links)
• A local convergence property of primal-dual methods for nonlinear programming (Q948957) (← links)
• A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• A unified Lagrangian formulation for solid and fluid dynamics and its possibility for modelling submarine landslides and their consequences (Q1986455) (← links)
• Portfolio optimization with entropic value-at-risk (Q2001477) (← links)
• Mathematical optimization problems for particle finite element analysis applied to 2D landslide modeling (Q2022101) (← links)
• Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
• A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
• Modeling and inverse identification method for the characterization of elastic-plastic contact behavior during flat punch indentation (Q2168376) (← links)
• Learning to steer nonlinear interior-point methods (Q2175369) (← links)
• Newton-type methods: a broader view (Q2260691) (← links)
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
• Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
• Local analysis of the feasible primal-dual interior-point method (Q2427394) (← links)
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming (Q2490321) (← links)
• An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
• Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
• An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
• A Globally and Superlinearly Convergent Primal-dual Interior Point Method for General Constrained Optimization (Q2991816) (← links)
• Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods (Q3089761) (← links)
• An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization (Q3462308) (← links)
• (Q3640729) (← links)
• A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming (Q4521377) (← links)
• Allee optimal control of a system in ecology (Q4630556) (← links)
• A general class of penalty/barrier path-following Newton methods for nonlinear programming (Q4675963) (← links)
• Infeasible constraint-reduced interior-point methods for linear optimization (Q5200562) (← links)
• Optimization-based approach to path planning for closed chain robot systems (Q5403422) (← links)
• On second-order optimality conditions for nonlinear programming (Q5426957) (← links)
• Lagrangian modelling of large deformation induced by progressive failure of sensitive clays with elastoviscoplasticity (Q6557564) (← links)
• A novel implicit FEM-MPM coupling framework using convex cone programming for elastoplastic problems (Q6588311) (← links)