An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization (Q898716): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Ipopt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/jimo.2016.12.949 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2525179912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A line search exact penalty method using steering rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steering exact penalty methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted isometry properties and nonconvex compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing methods for nonsmooth, nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual trust-region algorithm for non-convex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty-interior-point algorithm for nonlinear constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Newton interior-point method for nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Augmented Lagrangian Approach to Duality and Exact Penalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust SQP method based on a smoothing lower order penalty function† / rank
 
Normal rank
Property / cites work
 
Property / cites work: First- and second-order necessary conditions via exact penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Conditions via Exact Penalty Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the smoothing of the square-root exact penalty function for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic decrease of the penalty parameter in exact penalty function methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decreasing Functions with Applications to Penalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions in smooth nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point algorithm for nonconvex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange Multipliers and Calmness Conditions of Order <i>p</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank

Latest revision as of 06:02, 11 July 2024

scientific article
Language Label Description Also known as
English
An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
scientific article

    Statements

    An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization (English)
    0 references
    18 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    nonlinear programming
    0 references
    lower-order penalty function
    0 references
    quadratic relaxation
    0 references
    constraint qualification
    0 references
    primal-dual interior-point method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references